./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-84.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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:20,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:20,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:27:20,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:20,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:20,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:20,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:20,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:20,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:20,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:20,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:20,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:20,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:27:20,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:20,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:20,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:20,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:20,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:20,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:20,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:20,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:20,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:20,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:27:20,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:27:20,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:20,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:20,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:20,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:20,535 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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2025-01-09 15:27:20,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:20,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:20,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:20,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:20,777 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:20,777 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-84.i [2025-01-09 15:27:21,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa3a1a270/346340e81faf4db3b60cdb3d54b0f765/FLAG9b93cf953 [2025-01-09 15:27:22,173 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:22,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2025-01-09 15:27:22,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa3a1a270/346340e81faf4db3b60cdb3d54b0f765/FLAG9b93cf953 [2025-01-09 15:27:22,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa3a1a270/346340e81faf4db3b60cdb3d54b0f765 [2025-01-09 15:27:22,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:22,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:22,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:22,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:22,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:22,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22, skipping insertion in model container [2025-01-09 15:27:22,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:22,335 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-84.i[916,929] [2025-01-09 15:27:22,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:22,411 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:22,420 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-84.i[916,929] [2025-01-09 15:27:22,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:22,470 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:22,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22 WrapperNode [2025-01-09 15:27:22,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:22,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:22,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:22,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:22,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,523 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2025-01-09 15:27:22,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:22,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:22,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:22,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:22,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,551 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2025-01-09 15:27:22,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:22,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:22,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:22,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:22,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (1/1) ... [2025-01-09 15:27:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:22,631 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-01-09 15:27:22,635 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-01-09 15:27:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:27:22,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:27:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:27:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:27:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:22,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:27:22,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:27:22,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:22,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:22,769 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:22,770 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:23,153 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:23,154 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:23,161 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:23,161 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:23,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:23 BoogieIcfgContainer [2025-01-09 15:27:23,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:23,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:23,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:23,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:23,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:22" (1/3) ... [2025-01-09 15:27:23,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdddbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:23, skipping insertion in model container [2025-01-09 15:27:23,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:22" (2/3) ... [2025-01-09 15:27:23,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdddbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:23, skipping insertion in model container [2025-01-09 15:27:23,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:23" (3/3) ... [2025-01-09 15:27:23,168 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2025-01-09 15:27:23,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:23,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-84.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:23,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:23,242 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;@4ff7cf77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:23,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:27:23,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:23,257 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:23,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash -200139350, now seen corresponding path program 1 times [2025-01-09 15:27:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:23,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781086977] [2025-01-09 15:27:23,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:27:23,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:27:23,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:27:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781086977] [2025-01-09 15:27:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781086977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803532877] [2025-01-09 15:27:23,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:23,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:23,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:23,517 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-01-09 15:27:23,518 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-01-09 15:27:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:27:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:27:23,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:23,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:23,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 15:27:23,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803532877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:23,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:27:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314595978] [2025-01-09 15:27:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:23,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:23,780 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:23,798 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-01-09 15:27:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:23,799 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2025-01-09 15:27:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:23,803 INFO L225 Difference]: With dead ends: 198 [2025-01-09 15:27:23,803 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:27:23,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-01-09 15:27:23,806 INFO L435 NwaCegarLoop]: 141 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, 141 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-01-09 15:27:23,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:27:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 15:27:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-01-09 15:27:23,833 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2025-01-09 15:27:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:23,833 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-01-09 15:27:23,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-01-09 15:27:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:27:23,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:23,835 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:23,842 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-01-09 15:27:24,036 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-01-09 15:27:24,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash -521781750, now seen corresponding path program 1 times [2025-01-09 15:27:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470898874] [2025-01-09 15:27:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:24,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:27:24,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:27:24,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:24,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:24,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:24,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470898874] [2025-01-09 15:27:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470898874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:24,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:24,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:24,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124024940] [2025-01-09 15:27:24,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:24,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:24,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:24,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:24,357 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:24,402 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-01-09 15:27:24,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:24,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-01-09 15:27:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:24,404 INFO L225 Difference]: With dead ends: 198 [2025-01-09 15:27:24,406 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 15:27:24,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:24,407 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:24,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 15:27:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-01-09 15:27:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:27:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-01-09 15:27:24,422 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2025-01-09 15:27:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:24,423 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-01-09 15:27:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-01-09 15:27:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:27:24,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:24,425 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:24,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:27:24,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:24,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash -519934708, now seen corresponding path program 1 times [2025-01-09 15:27:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380012535] [2025-01-09 15:27:24,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:24,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:27:24,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:27:24,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:24,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380012535] [2025-01-09 15:27:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380012535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:24,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108647614] [2025-01-09 15:27:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:24,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:24,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:24,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:24,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:24,733 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:24,934 INFO L93 Difference]: Finished difference Result 324 states and 459 transitions. [2025-01-09 15:27:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2025-01-09 15:27:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:24,936 INFO L225 Difference]: With dead ends: 324 [2025-01-09 15:27:24,936 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:27:24,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:24,937 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 293 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:24,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 535 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:27:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 199. [2025-01-09 15:27:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:27:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2025-01-09 15:27:24,960 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 150 [2025-01-09 15:27:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:24,960 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2025-01-09 15:27:24,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2025-01-09 15:27:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:27:24,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:24,962 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:27:24,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:24,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:24,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1377989034, now seen corresponding path program 1 times [2025-01-09 15:27:24,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:24,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001021497] [2025-01-09 15:27:24,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:27:25,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:27:25,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001021497] [2025-01-09 15:27:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001021497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:27:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536908424] [2025-01-09 15:27:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:27,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:27:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:27:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:27,445 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:28,909 INFO L93 Difference]: Finished difference Result 763 states and 1069 transitions. [2025-01-09 15:27:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:27:28,910 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2025-01-09 15:27:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:28,914 INFO L225 Difference]: With dead ends: 763 [2025-01-09 15:27:28,914 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 15:27:28,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:27:28,916 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 263 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:28,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 2722 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:27:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 15:27:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 345. [2025-01-09 15:27:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 286 states have (on average 1.3216783216783217) internal successors, (378), 288 states have internal predecessors, (378), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:27:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 486 transitions. [2025-01-09 15:27:28,958 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 486 transitions. Word has length 158 [2025-01-09 15:27:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 486 transitions. [2025-01-09 15:27:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 486 transitions. [2025-01-09 15:27:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:27:28,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:28,960 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:27:28,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1800690860, now seen corresponding path program 1 times [2025-01-09 15:27:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786377567] [2025-01-09 15:27:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:28,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:27:29,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:27:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786377567] [2025-01-09 15:27:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786377567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:27:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043878590] [2025-01-09 15:27:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:27:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:30,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:27:30,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:30,411 INFO L87 Difference]: Start difference. First operand 345 states and 486 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:31,062 INFO L93 Difference]: Finished difference Result 697 states and 980 transitions. [2025-01-09 15:27:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:27:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-01-09 15:27:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:31,065 INFO L225 Difference]: With dead ends: 697 [2025-01-09 15:27:31,065 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 15:27:31,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:27:31,068 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 96 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:31,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1392 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 15:27:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 331. [2025-01-09 15:27:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 272 states have (on average 1.3125) internal successors, (357), 274 states have internal predecessors, (357), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:27:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 465 transitions. [2025-01-09 15:27:31,101 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 465 transitions. Word has length 158 [2025-01-09 15:27:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:31,101 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 465 transitions. [2025-01-09 15:27:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 465 transitions. [2025-01-09 15:27:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:31,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:31,103 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:27:31,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1440009553, now seen corresponding path program 1 times [2025-01-09 15:27:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661701129] [2025-01-09 15:27:31,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:31,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:31,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:31,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661701129] [2025-01-09 15:27:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661701129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:27:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980349750] [2025-01-09 15:27:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:27:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:32,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:27:32,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:32,071 INFO L87 Difference]: Start difference. First operand 331 states and 465 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:32,507 INFO L93 Difference]: Finished difference Result 803 states and 1125 transitions. [2025-01-09 15:27:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:32,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:32,511 INFO L225 Difference]: With dead ends: 803 [2025-01-09 15:27:32,511 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 15:27:32,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:32,514 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 80 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:32,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1113 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 15:27:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 363. [2025-01-09 15:27:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 304 states have (on average 1.3223684210526316) internal successors, (402), 306 states have internal predecessors, (402), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:27:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 510 transitions. [2025-01-09 15:27:32,546 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 510 transitions. Word has length 160 [2025-01-09 15:27:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 510 transitions. [2025-01-09 15:27:32,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 510 transitions. [2025-01-09 15:27:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:32,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:32,549 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:32,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:27:32,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 739013, now seen corresponding path program 1 times [2025-01-09 15:27:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:32,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314402954] [2025-01-09 15:27:32,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:32,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:32,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:32,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:32,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:32,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314402954] [2025-01-09 15:27:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314402954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:32,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:32,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633325535] [2025-01-09 15:27:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:32,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:32,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:32,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:32,800 INFO L87 Difference]: Start difference. First operand 363 states and 510 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:32,853 INFO L93 Difference]: Finished difference Result 905 states and 1269 transitions. [2025-01-09 15:27:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-01-09 15:27:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:32,856 INFO L225 Difference]: With dead ends: 905 [2025-01-09 15:27:32,856 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 15:27:32,858 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-01-09 15:27:32,860 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 39 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:32,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 664 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 15:27:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 459. [2025-01-09 15:27:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 400 states have (on average 1.3425) internal successors, (537), 402 states have internal predecessors, (537), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:27:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 645 transitions. [2025-01-09 15:27:32,892 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 645 transitions. Word has length 160 [2025-01-09 15:27:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:32,892 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 645 transitions. [2025-01-09 15:27:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 645 transitions. [2025-01-09 15:27:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:32,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:32,894 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:32,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:27:32,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 258904451, now seen corresponding path program 1 times [2025-01-09 15:27:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:32,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-01-09 15:27:32,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:32,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:32,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:32,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:32,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 15:27:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-01-09 15:27:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453669943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88075934] [2025-01-09 15:27:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:33,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:33,007 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-01-09 15:27:33,009 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-01-09 15:27:33,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:33,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:33,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:33,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:33,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:33,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:33,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:33,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88075934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:33,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:33,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:27:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114209545] [2025-01-09 15:27:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:33,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:33,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:33,189 INFO L87 Difference]: Start difference. First operand 459 states and 645 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:33,224 INFO L93 Difference]: Finished difference Result 927 states and 1303 transitions. [2025-01-09 15:27:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:33,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:27:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:33,228 INFO L225 Difference]: With dead ends: 927 [2025-01-09 15:27:33,229 INFO L226 Difference]: Without dead ends: 471 [2025-01-09 15:27:33,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:33,230 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:33,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-09 15:27:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-01-09 15:27:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 412 states have (on average 1.3325242718446602) internal successors, (549), 414 states have internal predecessors, (549), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:27:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 657 transitions. [2025-01-09 15:27:33,261 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 657 transitions. Word has length 160 [2025-01-09 15:27:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:33,261 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 657 transitions. [2025-01-09 15:27:33,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 657 transitions. [2025-01-09 15:27:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:33,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:33,265 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:33,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:33,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:33,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:33,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash 860813037, now seen corresponding path program 1 times [2025-01-09 15:27:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198098360] [2025-01-09 15:27:33,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:33,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:33,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198098360] [2025-01-09 15:27:33,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198098360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:33,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:33,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:33,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861415345] [2025-01-09 15:27:33,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:33,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:33,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:33,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:33,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:33,683 INFO L87 Difference]: Start difference. First operand 471 states and 657 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:33,909 INFO L93 Difference]: Finished difference Result 1223 states and 1696 transitions. [2025-01-09 15:27:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:27:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:33,913 INFO L225 Difference]: With dead ends: 1223 [2025-01-09 15:27:33,913 INFO L226 Difference]: Without dead ends: 755 [2025-01-09 15:27:33,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:33,914 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 82 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:33,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 516 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-01-09 15:27:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 751. [2025-01-09 15:27:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 650 states have (on average 1.303076923076923) internal successors, (847), 656 states have internal predecessors, (847), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1031 transitions. [2025-01-09 15:27:33,949 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1031 transitions. Word has length 160 [2025-01-09 15:27:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:33,950 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1031 transitions. [2025-01-09 15:27:33,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1031 transitions. [2025-01-09 15:27:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:33,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:33,952 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:33,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:27:33,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -419050641, now seen corresponding path program 1 times [2025-01-09 15:27:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223235967] [2025-01-09 15:27:33,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:33,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:33,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:33,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:33,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:34,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223235967] [2025-01-09 15:27:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223235967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:27:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90644472] [2025-01-09 15:27:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:34,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:27:34,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:27:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:34,878 INFO L87 Difference]: Start difference. First operand 751 states and 1031 transitions. Second operand has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:35,551 INFO L93 Difference]: Finished difference Result 1737 states and 2370 transitions. [2025-01-09 15:27:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:27:35,552 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:35,558 INFO L225 Difference]: With dead ends: 1737 [2025-01-09 15:27:35,558 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 15:27:35,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:35,560 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 77 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:35,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1276 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 15:27:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 759. [2025-01-09 15:27:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 658 states have (on average 1.2993920972644377) internal successors, (855), 664 states have internal predecessors, (855), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1039 transitions. [2025-01-09 15:27:35,607 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1039 transitions. Word has length 160 [2025-01-09 15:27:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:35,607 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1039 transitions. [2025-01-09 15:27:35,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1039 transitions. [2025-01-09 15:27:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:35,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:35,610 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:27:35,610 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash -139809597, now seen corresponding path program 1 times [2025-01-09 15:27:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257352450] [2025-01-09 15:27:35,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:35,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:35,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257352450] [2025-01-09 15:27:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257352450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:36,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:36,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:27:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666882949] [2025-01-09 15:27:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:36,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:36,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:36,436 INFO L87 Difference]: Start difference. First operand 759 states and 1039 transitions. Second operand has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:37,000 INFO L93 Difference]: Finished difference Result 1935 states and 2650 transitions. [2025-01-09 15:27:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:37,006 INFO L225 Difference]: With dead ends: 1935 [2025-01-09 15:27:37,006 INFO L226 Difference]: Without dead ends: 1179 [2025-01-09 15:27:37,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:37,009 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 85 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:37,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1287 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2025-01-09 15:27:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 721. [2025-01-09 15:27:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 620 states have (on average 1.3048387096774194) internal successors, (809), 626 states have internal predecessors, (809), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 993 transitions. [2025-01-09 15:27:37,055 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 993 transitions. Word has length 160 [2025-01-09 15:27:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 993 transitions. [2025-01-09 15:27:37,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 993 transitions. [2025-01-09 15:27:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:37,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:37,056 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:27:37,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:37,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -668429489, now seen corresponding path program 1 times [2025-01-09 15:27:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305857543] [2025-01-09 15:27:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:37,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:37,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305857543] [2025-01-09 15:27:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305857543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:37,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7865308] [2025-01-09 15:27:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:37,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:37,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:37,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:37,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:37,777 INFO L87 Difference]: Start difference. First operand 721 states and 993 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:38,269 INFO L93 Difference]: Finished difference Result 1725 states and 2374 transitions. [2025-01-09 15:27:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:38,276 INFO L225 Difference]: With dead ends: 1725 [2025-01-09 15:27:38,276 INFO L226 Difference]: Without dead ends: 1007 [2025-01-09 15:27:38,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:38,278 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 84 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:38,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 964 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-01-09 15:27:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 783. [2025-01-09 15:27:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 682 states have (on average 1.31524926686217) internal successors, (897), 688 states have internal predecessors, (897), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1081 transitions. [2025-01-09 15:27:38,353 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1081 transitions. Word has length 160 [2025-01-09 15:27:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1081 transitions. [2025-01-09 15:27:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1081 transitions. [2025-01-09 15:27:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:38,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:38,357 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:27:38,357 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1689497843, now seen corresponding path program 1 times [2025-01-09 15:27:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724150558] [2025-01-09 15:27:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:38,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:38,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:38,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724150558] [2025-01-09 15:27:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724150558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:27:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225872526] [2025-01-09 15:27:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:27:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:27:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:39,075 INFO L87 Difference]: Start difference. First operand 783 states and 1081 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:39,631 INFO L93 Difference]: Finished difference Result 2125 states and 2924 transitions. [2025-01-09 15:27:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:39,636 INFO L225 Difference]: With dead ends: 2125 [2025-01-09 15:27:39,636 INFO L226 Difference]: Without dead ends: 1345 [2025-01-09 15:27:39,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:39,638 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 81 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:39,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1198 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-01-09 15:27:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 887. [2025-01-09 15:27:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 786 states have (on average 1.3295165394402035) internal successors, (1045), 792 states have internal predecessors, (1045), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1229 transitions. [2025-01-09 15:27:39,684 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1229 transitions. Word has length 160 [2025-01-09 15:27:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:39,684 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1229 transitions. [2025-01-09 15:27:39,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1229 transitions. [2025-01-09 15:27:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:39,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:39,686 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:39,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:27:39,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 233730191, now seen corresponding path program 1 times [2025-01-09 15:27:39,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:39,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76279576] [2025-01-09 15:27:39,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:39,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:39,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76279576] [2025-01-09 15:27:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76279576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583793686] [2025-01-09 15:27:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:40,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:40,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:40,071 INFO L87 Difference]: Start difference. First operand 887 states and 1229 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:40,263 INFO L93 Difference]: Finished difference Result 1719 states and 2379 transitions. [2025-01-09 15:27:40,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:40,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-01-09 15:27:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:40,267 INFO L225 Difference]: With dead ends: 1719 [2025-01-09 15:27:40,267 INFO L226 Difference]: Without dead ends: 835 [2025-01-09 15:27:40,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:40,268 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:40,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 632 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-01-09 15:27:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2025-01-09 15:27:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 734 states have (on average 1.3174386920980927) internal successors, (967), 740 states have internal predecessors, (967), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1151 transitions. [2025-01-09 15:27:40,308 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1151 transitions. Word has length 160 [2025-01-09 15:27:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:40,309 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1151 transitions. [2025-01-09 15:27:40,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1151 transitions. [2025-01-09 15:27:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:40,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:40,311 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:40,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:27:40,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:40,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1417377299, now seen corresponding path program 1 times [2025-01-09 15:27:40,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:40,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313806906] [2025-01-09 15:27:40,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:40,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:40,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:40,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:40,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:40,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313806906] [2025-01-09 15:27:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313806906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:27:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896606590] [2025-01-09 15:27:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:40,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:27:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:40,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:27:40,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:40,972 INFO L87 Difference]: Start difference. First operand 835 states and 1151 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:41,508 INFO L93 Difference]: Finished difference Result 1897 states and 2598 transitions. [2025-01-09 15:27:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:41,512 INFO L225 Difference]: With dead ends: 1897 [2025-01-09 15:27:41,512 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 15:27:41,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:41,514 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 80 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:41,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1213 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 15:27:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 827. [2025-01-09 15:27:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 726 states have (on average 1.315426997245179) internal successors, (955), 732 states have internal predecessors, (955), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1139 transitions. [2025-01-09 15:27:41,583 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1139 transitions. Word has length 160 [2025-01-09 15:27:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:41,583 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1139 transitions. [2025-01-09 15:27:41,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1139 transitions. [2025-01-09 15:27:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:41,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:41,585 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:41,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:27:41,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:41,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:41,586 INFO L85 PathProgramCache]: Analyzing trace with hash -396418387, now seen corresponding path program 1 times [2025-01-09 15:27:41,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:41,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414398239] [2025-01-09 15:27:41,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:41,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:41,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:41,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414398239] [2025-01-09 15:27:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414398239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755964959] [2025-01-09 15:27:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:42,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:42,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:42,165 INFO L87 Difference]: Start difference. First operand 827 states and 1139 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:42,653 INFO L93 Difference]: Finished difference Result 1869 states and 2558 transitions. [2025-01-09 15:27:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:42,661 INFO L225 Difference]: With dead ends: 1869 [2025-01-09 15:27:42,661 INFO L226 Difference]: Without dead ends: 1045 [2025-01-09 15:27:42,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:42,664 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 75 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:42,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1432 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-01-09 15:27:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 777. [2025-01-09 15:27:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 676 states have (on average 1.3032544378698225) internal successors, (881), 682 states have internal predecessors, (881), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:27:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1065 transitions. [2025-01-09 15:27:42,708 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1065 transitions. Word has length 160 [2025-01-09 15:27:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:42,709 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1065 transitions. [2025-01-09 15:27:42,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1065 transitions. [2025-01-09 15:27:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:42,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:42,710 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:42,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:27:42,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -645797235, now seen corresponding path program 1 times [2025-01-09 15:27:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996825761] [2025-01-09 15:27:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:42,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:42,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:42,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:42,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:42,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996825761] [2025-01-09 15:27:42,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996825761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913469132] [2025-01-09 15:27:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:42,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:42,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:42,980 INFO L87 Difference]: Start difference. First operand 777 states and 1065 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:43,231 INFO L93 Difference]: Finished difference Result 1944 states and 2652 transitions. [2025-01-09 15:27:43,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-01-09 15:27:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:43,235 INFO L225 Difference]: With dead ends: 1944 [2025-01-09 15:27:43,235 INFO L226 Difference]: Without dead ends: 1170 [2025-01-09 15:27:43,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:43,237 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 104 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:43,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 547 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:43,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-01-09 15:27:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 793. [2025-01-09 15:27:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 685 states have (on average 1.2934306569343066) internal successors, (886), 691 states have internal predecessors, (886), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 15:27:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1080 transitions. [2025-01-09 15:27:43,290 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1080 transitions. Word has length 160 [2025-01-09 15:27:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1080 transitions. [2025-01-09 15:27:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:27:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1080 transitions. [2025-01-09 15:27:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:43,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:43,292 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:27:43,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:43,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1277430799, now seen corresponding path program 1 times [2025-01-09 15:27:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883102146] [2025-01-09 15:27:43,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:43,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:43,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:44,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:44,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883102146] [2025-01-09 15:27:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883102146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:27:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513846284] [2025-01-09 15:27:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:44,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:27:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:44,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:27:44,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:44,044 INFO L87 Difference]: Start difference. First operand 793 states and 1080 transitions. Second operand has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:44,568 INFO L93 Difference]: Finished difference Result 1878 states and 2554 transitions. [2025-01-09 15:27:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:27:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-01-09 15:27:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:44,572 INFO L225 Difference]: With dead ends: 1878 [2025-01-09 15:27:44,572 INFO L226 Difference]: Without dead ends: 1088 [2025-01-09 15:27:44,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:27:44,574 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 84 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1147 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-01-09 15:27:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 672. [2025-01-09 15:27:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 585 states have (on average 1.3025641025641026) internal successors, (762), 589 states have internal predecessors, (762), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:27:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 918 transitions. [2025-01-09 15:27:44,618 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 918 transitions. Word has length 160 [2025-01-09 15:27:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 918 transitions. [2025-01-09 15:27:44,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 918 transitions. [2025-01-09 15:27:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:27:44,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:44,620 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:44,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:27:44,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 256362445, now seen corresponding path program 1 times [2025-01-09 15:27:44,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:44,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491621426] [2025-01-09 15:27:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:27:44,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:27:44,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:44,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491621426] [2025-01-09 15:27:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491621426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444670506] [2025-01-09 15:27:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:45,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:45,196 INFO L87 Difference]: Start difference. First operand 672 states and 918 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,620 INFO L93 Difference]: Finished difference Result 1465 states and 1996 transitions. [2025-01-09 15:27:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 15:27:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:45,623 INFO L225 Difference]: With dead ends: 1465 [2025-01-09 15:27:45,623 INFO L226 Difference]: Without dead ends: 796 [2025-01-09 15:27:45,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:45,624 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1163 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-01-09 15:27:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 646. [2025-01-09 15:27:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 559 states have (on average 1.293381037567084) internal successors, (723), 563 states have internal predecessors, (723), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:27:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 879 transitions. [2025-01-09 15:27:45,664 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 879 transitions. Word has length 160 [2025-01-09 15:27:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:45,665 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 879 transitions. [2025-01-09 15:27:45,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 879 transitions. [2025-01-09 15:27:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:45,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:45,666 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:45,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:27:45,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:45,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1962729461, now seen corresponding path program 1 times [2025-01-09 15:27:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382111656] [2025-01-09 15:27:45,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:45,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:45,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 15:27:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382111656] [2025-01-09 15:27:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382111656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654814262] [2025-01-09 15:27:45,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:45,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:45,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:45,782 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-01-09 15:27:45,784 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-01-09 15:27:45,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:45,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:45,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:45,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:45,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654814262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:45,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:45,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:27:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415291655] [2025-01-09 15:27:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:45,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:45,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:45,975 INFO L87 Difference]: Start difference. First operand 646 states and 879 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:46,021 INFO L93 Difference]: Finished difference Result 1307 states and 1779 transitions. [2025-01-09 15:27:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:27:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:46,023 INFO L225 Difference]: With dead ends: 1307 [2025-01-09 15:27:46,024 INFO L226 Difference]: Without dead ends: 664 [2025-01-09 15:27:46,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:46,025 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:46,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-01-09 15:27:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2025-01-09 15:27:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 577 states have (on average 1.2842287694974004) internal successors, (741), 581 states have internal predecessors, (741), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:27:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 897 transitions. [2025-01-09 15:27:46,064 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 897 transitions. Word has length 162 [2025-01-09 15:27:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:46,064 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 897 transitions. [2025-01-09 15:27:46,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 897 transitions. [2025-01-09 15:27:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:46,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:46,066 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:46,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:27:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:46,266 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:46,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:46,267 INFO L85 PathProgramCache]: Analyzing trace with hash -953188588, now seen corresponding path program 1 times [2025-01-09 15:27:46,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134728790] [2025-01-09 15:27:46,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:46,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:46,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:46,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:46,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134728790] [2025-01-09 15:27:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134728790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:46,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:27:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230758310] [2025-01-09 15:27:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:46,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:27:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:46,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:27:46,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:46,996 INFO L87 Difference]: Start difference. First operand 664 states and 897 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:48,134 INFO L93 Difference]: Finished difference Result 2327 states and 3107 transitions. [2025-01-09 15:27:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:27:48,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-01-09 15:27:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:48,140 INFO L225 Difference]: With dead ends: 2327 [2025-01-09 15:27:48,140 INFO L226 Difference]: Without dead ends: 1666 [2025-01-09 15:27:48,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-01-09 15:27:48,142 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 335 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:48,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2137 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:27:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-01-09 15:27:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1026. [2025-01-09 15:27:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 879 states have (on average 1.2673492605233219) internal successors, (1114), 887 states have internal predecessors, (1114), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2025-01-09 15:27:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1374 transitions. [2025-01-09 15:27:48,220 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1374 transitions. Word has length 162 [2025-01-09 15:27:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:48,220 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1374 transitions. [2025-01-09 15:27:48,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1374 transitions. [2025-01-09 15:27:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:48,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:48,221 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:48,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:27:48,221 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:48,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:48,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2061915030, now seen corresponding path program 1 times [2025-01-09 15:27:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491653826] [2025-01-09 15:27:48,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:48,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:48,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:48,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491653826] [2025-01-09 15:27:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491653826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022194876] [2025-01-09 15:27:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:48,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:48,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:48,384 INFO L87 Difference]: Start difference. First operand 1026 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:48,714 INFO L93 Difference]: Finished difference Result 2583 states and 3443 transitions. [2025-01-09 15:27:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:27:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:48,720 INFO L225 Difference]: With dead ends: 2583 [2025-01-09 15:27:48,720 INFO L226 Difference]: Without dead ends: 1560 [2025-01-09 15:27:48,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:48,723 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 80 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:48,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 686 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-01-09 15:27:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 878. [2025-01-09 15:27:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 757 states have (on average 1.2575957727873184) internal successors, (952), 763 states have internal predecessors, (952), 106 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 15:27:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1164 transitions. [2025-01-09 15:27:48,794 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1164 transitions. Word has length 162 [2025-01-09 15:27:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:48,794 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1164 transitions. [2025-01-09 15:27:48,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:27:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1164 transitions. [2025-01-09 15:27:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:48,795 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:48,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:27:48,796 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 67770324, now seen corresponding path program 1 times [2025-01-09 15:27:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:48,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809299342] [2025-01-09 15:27:48,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:48,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:48,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:48,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:48,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:48,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809299342] [2025-01-09 15:27:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809299342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:49,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:27:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936384944] [2025-01-09 15:27:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:49,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:27:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:49,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:27:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:49,482 INFO L87 Difference]: Start difference. First operand 878 states and 1164 transitions. Second operand has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:50,002 INFO L93 Difference]: Finished difference Result 1759 states and 2329 transitions. [2025-01-09 15:27:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:27:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2025-01-09 15:27:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:50,006 INFO L225 Difference]: With dead ends: 1759 [2025-01-09 15:27:50,006 INFO L226 Difference]: Without dead ends: 872 [2025-01-09 15:27:50,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:50,007 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:50,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1295 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-01-09 15:27:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 805. [2025-01-09 15:27:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 697 states have (on average 1.2525107604017216) internal successors, (873), 702 states have internal predecessors, (873), 94 states have call successors, (94), 13 states have call predecessors, (94), 13 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 15:27:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1061 transitions. [2025-01-09 15:27:50,103 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1061 transitions. Word has length 162 [2025-01-09 15:27:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:50,104 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1061 transitions. [2025-01-09 15:27:50,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.222222222222222) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1061 transitions. [2025-01-09 15:27:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:50,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:50,105 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:50,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:27:50,105 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:50,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1536340374, now seen corresponding path program 1 times [2025-01-09 15:27:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300209227] [2025-01-09 15:27:50,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:50,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:50,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:50,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:50,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:50,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300209227] [2025-01-09 15:27:50,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300209227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:50,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:27:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492977883] [2025-01-09 15:27:50,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:50,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:27:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:27:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:27:50,793 INFO L87 Difference]: Start difference. First operand 805 states and 1061 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:51,462 INFO L93 Difference]: Finished difference Result 1613 states and 2125 transitions. [2025-01-09 15:27:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:27:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-01-09 15:27:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:51,465 INFO L225 Difference]: With dead ends: 1613 [2025-01-09 15:27:51,465 INFO L226 Difference]: Without dead ends: 811 [2025-01-09 15:27:51,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:27:51,467 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 103 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2079 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-01-09 15:27:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 759. [2025-01-09 15:27:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 651 states have (on average 1.2565284178187404) internal successors, (818), 656 states have internal predecessors, (818), 94 states have call successors, (94), 13 states have call predecessors, (94), 13 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 15:27:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1006 transitions. [2025-01-09 15:27:51,533 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1006 transitions. Word has length 162 [2025-01-09 15:27:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:51,533 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1006 transitions. [2025-01-09 15:27:51,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1006 transitions. [2025-01-09 15:27:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:51,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:51,534 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:51,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:27:51,535 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash 707774420, now seen corresponding path program 1 times [2025-01-09 15:27:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935654779] [2025-01-09 15:27:51,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:51,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:51,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:51,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935654779] [2025-01-09 15:27:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935654779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629340032] [2025-01-09 15:27:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:52,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:52,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:52,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:52,235 INFO L87 Difference]: Start difference. First operand 759 states and 1006 transitions. Second operand has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:52,817 INFO L93 Difference]: Finished difference Result 1637 states and 2173 transitions. [2025-01-09 15:27:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2025-01-09 15:27:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:52,820 INFO L225 Difference]: With dead ends: 1637 [2025-01-09 15:27:52,820 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 15:27:52,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:52,822 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 90 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:52,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 944 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 15:27:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 815. [2025-01-09 15:27:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 693 states have (on average 1.253968253968254) internal successors, (869), 699 states have internal predecessors, (869), 106 states have call successors, (106), 15 states have call predecessors, (106), 15 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 15:27:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1081 transitions. [2025-01-09 15:27:52,948 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1081 transitions. Word has length 162 [2025-01-09 15:27:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1081 transitions. [2025-01-09 15:27:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:27:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1081 transitions. [2025-01-09 15:27:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:52,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:52,949 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:52,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:27:52,949 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1728733332, now seen corresponding path program 1 times [2025-01-09 15:27:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194786185] [2025-01-09 15:27:52,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:52,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:53,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:53,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194786185] [2025-01-09 15:27:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194786185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:27:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089976513] [2025-01-09 15:27:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:53,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:27:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:27:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:53,806 INFO L87 Difference]: Start difference. First operand 815 states and 1081 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:55,241 INFO L93 Difference]: Finished difference Result 2055 states and 2709 transitions. [2025-01-09 15:27:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:27:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-01-09 15:27:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:55,245 INFO L225 Difference]: With dead ends: 2055 [2025-01-09 15:27:55,246 INFO L226 Difference]: Without dead ends: 1243 [2025-01-09 15:27:55,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:27:55,247 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 276 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:55,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2907 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:27:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-01-09 15:27:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 857. [2025-01-09 15:27:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 735 states have (on average 1.2476190476190476) internal successors, (917), 741 states have internal predecessors, (917), 106 states have call successors, (106), 15 states have call predecessors, (106), 15 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 15:27:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1129 transitions. [2025-01-09 15:27:55,324 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1129 transitions. Word has length 162 [2025-01-09 15:27:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1129 transitions. [2025-01-09 15:27:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1129 transitions. [2025-01-09 15:27:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:27:55,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:55,325 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:55,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:27:55,325 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:55,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -76705002, now seen corresponding path program 1 times [2025-01-09 15:27:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901363529] [2025-01-09 15:27:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:55,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:27:55,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:27:55,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:55,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:27:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901363529] [2025-01-09 15:27:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901363529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:27:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996379707] [2025-01-09 15:27:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:55,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:27:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:55,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:27:55,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:27:55,976 INFO L87 Difference]: Start difference. First operand 857 states and 1129 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:56,665 INFO L93 Difference]: Finished difference Result 1785 states and 2349 transitions. [2025-01-09 15:27:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:27:56,666 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2025-01-09 15:27:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:56,669 INFO L225 Difference]: With dead ends: 1785 [2025-01-09 15:27:56,669 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 15:27:56,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:27:56,671 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 97 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:56,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 2007 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 15:27:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 811. [2025-01-09 15:27:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 689 states have (on average 1.251088534107402) internal successors, (862), 695 states have internal predecessors, (862), 106 states have call successors, (106), 15 states have call predecessors, (106), 15 states have return successors, (106), 100 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 15:27:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1074 transitions. [2025-01-09 15:27:56,773 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1074 transitions. Word has length 162 [2025-01-09 15:27:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:56,773 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1074 transitions. [2025-01-09 15:27:56,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 15:27:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1074 transitions. [2025-01-09 15:27:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 15:27:56,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:56,774 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:56,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:27:56,774 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -881681042, now seen corresponding path program 1 times [2025-01-09 15:27:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767812236] [2025-01-09 15:27:56,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:56,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 15:27:56,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 15:27:56,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:56,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:56,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:27:56,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 15:27:56,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 15:27:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:56,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:27:56,917 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:27:56,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:27:56,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:27:56,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:57,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:27:57,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:27:57 BoogieIcfgContainer [2025-01-09 15:27:57,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:27:57,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:27:57,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:27:57,012 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:27:57,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:23" (3/4) ... [2025-01-09 15:27:57,016 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:27:57,016 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:27:57,017 INFO L158 Benchmark]: Toolchain (without parser) took 34814.19ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 129.2MB in the beginning and 408.5MB in the end (delta: -279.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.66ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 114.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.16ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 109.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: Boogie Preprocessor took 66.17ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 104.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: RCFGBuilder took 570.46ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 71.1MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: TraceAbstraction took 33848.95ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 70.6MB in the beginning and 408.7MB in the end (delta: -338.1MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2025-01-09 15:27:57,018 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 408.5MB in the end (delta: 147.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:57,019 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.66ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 114.2MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.16ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 109.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.17ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 104.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 570.46ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 71.1MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33848.95ms. Allocated memory was 167.8MB in the beginning and 461.4MB in the end (delta: 293.6MB). Free memory was 70.6MB in the beginning and 408.7MB in the end (delta: -338.1MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 461.4MB. Free memory was 408.7MB in the beginning and 408.5MB in the end (delta: 147.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 100. 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] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -4; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] isInitial = 1 [L105] FCALL initially() [L107] CALL updateLastVariables() [L96] EXPR signed_short_int_Array_0[0] [L96] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L97] EXPR unsigned_short_int_Array_0[0] [L97] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != last_1_unsigned_short_int_Array_0_0_ [L44] EXPR unsigned_char_Array_0[5] [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[1] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[6] = (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))) [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR unsigned_char_Array_0[4] [L51] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE ! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1]) [L52] signed_short_int_Array_0[1] = (32 - 8) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR float_Array_0[1] [L56] float_Array_0[0] = float_Array_0[1] [L57] EXPR unsigned_char_Array_0[6] [L57] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR unsigned_char_Array_0[5] [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L100] EXPR unsigned_char_Array_0[1] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L100] EXPR float_Array_0[0] [L100] EXPR float_Array_0[1] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.7s, OverallIterations: 28, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2713 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2672 mSDsluCounter, 31472 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26990 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17584 IncrementalHoareTripleChecker+Invalid, 17875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 4482 mSDtfsCounter, 17584 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1014 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=21, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 5304 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 4938 NumberOfCodeBlocks, 4938 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4744 ConstructedInterpolants, 0 QuantifiedInterpolants, 15112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1542 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 30 InterpolantComputations, 27 PerfectInterpolantSequences, 22648/22800 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-01-09 15:27:57,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:58,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:58,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:27:58,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:58,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:58,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:58,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:58,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:58,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:58,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:58,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:58,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:58,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:58,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:58,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:58,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:58,896 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:58,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:58,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:58,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:58,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:58,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:58,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:58,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:58,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:58,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:58,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:58,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:58,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:58,898 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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2025-01-09 15:27:59,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:59,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:59,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:59,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:59,126 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:59,127 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-84.i [2025-01-09 15:28:00,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9b671a7/18e741789e89489692580fcda82231a5/FLAG79562ab91 [2025-01-09 15:28:00,462 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:28:00,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2025-01-09 15:28:00,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9b671a7/18e741789e89489692580fcda82231a5/FLAG79562ab91 [2025-01-09 15:28:00,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f9b671a7/18e741789e89489692580fcda82231a5 [2025-01-09 15:28:00,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:28:00,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:28:00,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:28:00,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:28:00,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:28:00,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:00" (1/1) ... [2025-01-09 15:28:00,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678dea1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:00, skipping insertion in model container [2025-01-09 15:28:00,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:00" (1/1) ... [2025-01-09 15:28:00,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:28:00,929 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-84.i[916,929] [2025-01-09 15:28:00,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:28:00,978 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:28:00,985 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-84.i[916,929] [2025-01-09 15:28:01,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:28:01,043 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:28:01,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01 WrapperNode [2025-01-09 15:28:01,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:28:01,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:28:01,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:28:01,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:28:01,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,097 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2025-01-09 15:28:01,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:28:01,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:28:01,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:28:01,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:28:01,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,139 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2025-01-09 15:28:01,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:28:01,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:28:01,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:28:01,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:28:01,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (1/1) ... [2025-01-09 15:28:01,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:28:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:01,214 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-01-09 15:28:01,216 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-01-09 15:28:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:28:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:28:01,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:28:01,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:28:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:28:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:28:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:28:01,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:28:01,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:28:01,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:28:01,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:28:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:28:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:28:01,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:28:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:28:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:28:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:28:01,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:28:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:28:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:28:01,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:28:01,357 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:28:01,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:28:01,753 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-01-09 15:28:01,753 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:28:01,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:28:01,760 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:28:01,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:01 BoogieIcfgContainer [2025-01-09 15:28:01,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:28:01,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:28:01,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:28:01,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:28:01,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:28:00" (1/3) ... [2025-01-09 15:28:01,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c358195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:01, skipping insertion in model container [2025-01-09 15:28:01,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:01" (2/3) ... [2025-01-09 15:28:01,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c358195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:01, skipping insertion in model container [2025-01-09 15:28:01,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:01" (3/3) ... [2025-01-09 15:28:01,767 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2025-01-09 15:28:01,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:28:01,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-84.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:28:01,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:28:01,820 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;@3eeab55a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:28:01,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:28:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:28:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:28:01,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:01,834 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:01,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:01,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -200139350, now seen corresponding path program 1 times [2025-01-09 15:28:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:01,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559990916] [2025-01-09 15:28:01,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:01,845 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-01-09 15:28:01,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:01,847 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-01-09 15:28:01,849 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-01-09 15:28:01,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:28:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:28:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:28:02,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 15:28:02,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:02,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559990916] [2025-01-09 15:28:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559990916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:02,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:02,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:28:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041492085] [2025-01-09 15:28:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:28:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:02,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:28:02,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:28:02,175 INFO L87 Difference]: Start difference. First operand has 102 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:28:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:02,193 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-01-09 15:28:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:28:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2025-01-09 15:28:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:02,202 INFO L225 Difference]: With dead ends: 198 [2025-01-09 15:28:02,203 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:28:02,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-01-09 15:28:02,207 INFO L435 NwaCegarLoop]: 141 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, 141 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-01-09 15:28:02,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:28:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 15:28:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:28:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-01-09 15:28:02,239 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2025-01-09 15:28:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-01-09 15:28:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 15:28:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-01-09 15:28:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:28:02,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:02,242 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:02,248 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-01-09 15:28:02,443 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-01-09 15:28:02,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -521781750, now seen corresponding path program 1 times [2025-01-09 15:28:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026254403] [2025-01-09 15:28:02,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:02,445 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-01-09 15:28:02,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:02,447 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-01-09 15:28:02,448 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-01-09 15:28:02,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:28:02,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:28:02,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:02,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:02,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:28:02,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:02,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:28:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:02,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:02,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:02,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026254403] [2025-01-09 15:28:02,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026254403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:02,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:02,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:28:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314342554] [2025-01-09 15:28:02,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:02,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:02,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:02,944 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:03,209 INFO L93 Difference]: Finished difference Result 322 states and 460 transitions. [2025-01-09 15:28:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:03,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2025-01-09 15:28:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:03,212 INFO L225 Difference]: With dead ends: 322 [2025-01-09 15:28:03,212 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 15:28:03,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:03,213 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 203 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:03,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 512 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 15:28:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 195. [2025-01-09 15:28:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:28:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2025-01-09 15:28:03,244 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 150 [2025-01-09 15:28:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:03,244 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2025-01-09 15:28:03,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2025-01-09 15:28:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:28:03,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:03,246 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:03,253 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-01-09 15:28:03,446 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-01-09 15:28:03,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:03,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1376141992, now seen corresponding path program 1 times [2025-01-09 15:28:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515587768] [2025-01-09 15:28:03,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:03,447 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-01-09 15:28:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:03,450 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-01-09 15:28:03,451 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-01-09 15:28:03,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:28:03,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:28:03,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:03,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:03,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:28:03,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:03,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:03,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515587768] [2025-01-09 15:28:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515587768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239713005] [2025-01-09 15:28:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:03,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:03,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:03,689 INFO L87 Difference]: Start difference. First operand 195 states and 278 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:03,742 INFO L93 Difference]: Finished difference Result 401 states and 573 transitions. [2025-01-09 15:28:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:03,744 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2025-01-09 15:28:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:03,747 INFO L225 Difference]: With dead ends: 401 [2025-01-09 15:28:03,748 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 15:28:03,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:03,749 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:03,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 15:28:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-01-09 15:28:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 164 states have internal predecessors, (210), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 15:28:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 290 transitions. [2025-01-09 15:28:03,774 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 290 transitions. Word has length 158 [2025-01-09 15:28:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:03,775 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 290 transitions. [2025-01-09 15:28:03,775 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 290 transitions. [2025-01-09 15:28:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:28:03,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:03,778 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:03,785 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-01-09 15:28:03,979 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-01-09 15:28:03,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1377989034, now seen corresponding path program 1 times [2025-01-09 15:28:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536450380] [2025-01-09 15:28:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:03,980 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-01-09 15:28:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:03,982 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-01-09 15:28:03,983 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-01-09 15:28:04,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:28:04,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:28:04,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:04,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:04,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:28:04,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:04,262 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-01-09 15:28:04,267 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 14 treesize of output 10 [2025-01-09 15:28:04,353 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 25 treesize of output 24 [2025-01-09 15:28:04,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-01-09 15:28:04,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-01-09 15:28:05,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 79 [2025-01-09 15:28:05,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:05,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 42 [2025-01-09 15:28:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 15:28:05,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:05,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536450380] [2025-01-09 15:28:05,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536450380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:05,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:05,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:28:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516756255] [2025-01-09 15:28:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:05,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:28:05,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:05,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:28:05,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:28:05,496 INFO L87 Difference]: Start difference. First operand 207 states and 290 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 15:28:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:07,168 INFO L93 Difference]: Finished difference Result 555 states and 773 transitions. [2025-01-09 15:28:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:28:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 158 [2025-01-09 15:28:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:07,171 INFO L225 Difference]: With dead ends: 555 [2025-01-09 15:28:07,171 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 15:28:07,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:28:07,172 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 229 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:07,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 677 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:28:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 15:28:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2025-01-09 15:28:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 288 states have (on average 1.2951388888888888) internal successors, (373), 290 states have internal predecessors, (373), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:28:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 481 transitions. [2025-01-09 15:28:07,207 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 481 transitions. Word has length 158 [2025-01-09 15:28:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:07,208 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 481 transitions. [2025-01-09 15:28:07,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 5 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 15:28:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 481 transitions. [2025-01-09 15:28:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:07,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:07,210 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:07,219 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:07,410 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-01-09 15:28:07,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:07,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1440009553, now seen corresponding path program 1 times [2025-01-09 15:28:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638391051] [2025-01-09 15:28:07,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:07,412 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-01-09 15:28:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:07,414 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-01-09 15:28:07,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:28:07,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:07,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:07,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:07,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:07,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 15:28:07,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:07,718 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-01-09 15:28:07,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:28:07,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:28:07,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:07,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-01-09 15:28:08,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:08,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2025-01-09 15:28:08,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:08,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2025-01-09 15:28:08,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:08,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 27 [2025-01-09 15:28:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 547 proven. 42 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-01-09 15:28:08,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:08,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638391051] [2025-01-09 15:28:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638391051] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2025-01-09 15:28:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070995015] [2025-01-09 15:28:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:08,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:08,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:28:08,857 INFO L87 Difference]: Start difference. First operand 347 states and 481 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:09,325 INFO L93 Difference]: Finished difference Result 843 states and 1165 transitions. [2025-01-09 15:28:09,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:28:09,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:09,329 INFO L225 Difference]: With dead ends: 843 [2025-01-09 15:28:09,329 INFO L226 Difference]: Without dead ends: 499 [2025-01-09 15:28:09,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:28:09,330 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 146 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:09,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 591 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-01-09 15:28:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 379. [2025-01-09 15:28:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 320 states have (on average 1.30625) internal successors, (418), 322 states have internal predecessors, (418), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:28:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 526 transitions. [2025-01-09 15:28:09,360 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 526 transitions. Word has length 160 [2025-01-09 15:28:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:09,361 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 526 transitions. [2025-01-09 15:28:09,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 526 transitions. [2025-01-09 15:28:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:09,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:09,362 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:09,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:28:09,562 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-01-09 15:28:09,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:09,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 739013, now seen corresponding path program 1 times [2025-01-09 15:28:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163059047] [2025-01-09 15:28:09,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:09,564 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-01-09 15:28:09,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:09,566 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-01-09 15:28:09,568 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-01-09 15:28:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:09,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:28:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-01-09 15:28:09,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:10,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:10,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163059047] [2025-01-09 15:28:10,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163059047] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:10,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:10,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-01-09 15:28:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517496140] [2025-01-09 15:28:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:10,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:10,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:28:10,096 INFO L87 Difference]: Start difference. First operand 379 states and 526 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:10,164 INFO L93 Difference]: Finished difference Result 953 states and 1317 transitions. [2025-01-09 15:28:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:10,167 INFO L225 Difference]: With dead ends: 953 [2025-01-09 15:28:10,167 INFO L226 Difference]: Without dead ends: 577 [2025-01-09 15:28:10,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:10,168 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 39 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:10,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 538 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-01-09 15:28:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 475. [2025-01-09 15:28:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 416 states have (on average 1.3293269230769231) internal successors, (553), 418 states have internal predecessors, (553), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:28:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 661 transitions. [2025-01-09 15:28:10,219 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 661 transitions. Word has length 160 [2025-01-09 15:28:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:10,219 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 661 transitions. [2025-01-09 15:28:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 661 transitions. [2025-01-09 15:28:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:10,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:10,221 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:10,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:28:10,422 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-01-09 15:28:10,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 258904451, now seen corresponding path program 1 times [2025-01-09 15:28:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249847819] [2025-01-09 15:28:10,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:10,423 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-01-09 15:28:10,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:10,425 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-01-09 15:28:10,425 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-01-09 15:28:10,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:10,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:10,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:10,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:10,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:28:10,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:10,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:10,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249847819] [2025-01-09 15:28:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249847819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026974341] [2025-01-09 15:28:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:10,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:10,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:10,635 INFO L87 Difference]: Start difference. First operand 475 states and 661 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:10,679 INFO L93 Difference]: Finished difference Result 959 states and 1335 transitions. [2025-01-09 15:28:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:10,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:10,682 INFO L225 Difference]: With dead ends: 959 [2025-01-09 15:28:10,682 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 15:28:10,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-01-09 15:28:10,683 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:10,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 15:28:10,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-01-09 15:28:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 428 states have (on average 1.3200934579439252) internal successors, (565), 430 states have internal predecessors, (565), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:28:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 673 transitions. [2025-01-09 15:28:10,718 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 673 transitions. Word has length 160 [2025-01-09 15:28:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 673 transitions. [2025-01-09 15:28:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 673 transitions. [2025-01-09 15:28:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:10,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:10,719 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:10,727 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-01-09 15:28:10,919 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-01-09 15:28:10,920 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 860813037, now seen corresponding path program 1 times [2025-01-09 15:28:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877037270] [2025-01-09 15:28:10,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:10,920 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-01-09 15:28:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:10,922 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-01-09 15:28:10,923 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-01-09 15:28:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:11,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:11,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:11,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:11,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:28:11,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:11,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:11,165 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 41 treesize of output 17 [2025-01-09 15:28:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:11,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:11,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877037270] [2025-01-09 15:28:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877037270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005331232] [2025-01-09 15:28:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:11,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:11,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:11,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:11,190 INFO L87 Difference]: Start difference. First operand 487 states and 673 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:11,661 INFO L93 Difference]: Finished difference Result 1271 states and 1744 transitions. [2025-01-09 15:28:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:11,667 INFO L225 Difference]: With dead ends: 1271 [2025-01-09 15:28:11,667 INFO L226 Difference]: Without dead ends: 787 [2025-01-09 15:28:11,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:11,669 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 82 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:11,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 456 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-01-09 15:28:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2025-01-09 15:28:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 682 states have (on average 1.2888563049853372) internal successors, (879), 688 states have internal predecessors, (879), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:28:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1063 transitions. [2025-01-09 15:28:11,720 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1063 transitions. Word has length 160 [2025-01-09 15:28:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1063 transitions. [2025-01-09 15:28:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1063 transitions. [2025-01-09 15:28:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:11,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:11,721 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:11,728 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-01-09 15:28:11,922 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-01-09 15:28:11,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -419050641, now seen corresponding path program 1 times [2025-01-09 15:28:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450274539] [2025-01-09 15:28:11,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:11,923 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-01-09 15:28:11,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:11,924 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-01-09 15:28:11,925 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-01-09 15:28:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:12,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:12,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:12,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:12,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:28:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:12,204 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 14 treesize of output 10 [2025-01-09 15:28:12,288 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 36 treesize of output 29 [2025-01-09 15:28:12,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:12,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2025-01-09 15:28:13,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:13,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 47 [2025-01-09 15:28:13,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:13,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 28 [2025-01-09 15:28:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 443 proven. 27 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 15:28:13,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:13,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450274539] [2025-01-09 15:28:13,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450274539] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:13,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2025-01-09 15:28:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332875392] [2025-01-09 15:28:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:13,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:13,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:13,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:28:13,390 INFO L87 Difference]: Start difference. First operand 783 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:13,713 INFO L93 Difference]: Finished difference Result 1883 states and 2556 transitions. [2025-01-09 15:28:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:13,718 INFO L225 Difference]: With dead ends: 1883 [2025-01-09 15:28:13,718 INFO L226 Difference]: Without dead ends: 1103 [2025-01-09 15:28:13,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:28:13,720 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 164 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:13,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 408 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-01-09 15:28:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 841. [2025-01-09 15:28:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 740 states have (on average 1.295945945945946) internal successors, (959), 746 states have internal predecessors, (959), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:28:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1143 transitions. [2025-01-09 15:28:13,762 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1143 transitions. Word has length 160 [2025-01-09 15:28:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:13,762 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1143 transitions. [2025-01-09 15:28:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1143 transitions. [2025-01-09 15:28:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:13,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:13,764 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:13,772 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-01-09 15:28:13,968 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-01-09 15:28:13,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:13,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -139809597, now seen corresponding path program 1 times [2025-01-09 15:28:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919963984] [2025-01-09 15:28:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:13,969 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-01-09 15:28:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:13,970 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-01-09 15:28:13,971 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-01-09 15:28:14,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:14,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:14,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:14,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:14,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 15:28:14,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:14,281 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 19 treesize of output 1 [2025-01-09 15:28:14,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:28:14,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:28:14,393 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 14 treesize of output 10 [2025-01-09 15:28:14,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:14,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-01-09 15:28:14,900 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 68 treesize of output 49 [2025-01-09 15:28:15,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:15,311 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 140 treesize of output 92 [2025-01-09 15:28:15,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:15,317 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 130 treesize of output 88 [2025-01-09 15:28:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 415 proven. 12 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-01-09 15:28:15,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:15,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:15,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919963984] [2025-01-09 15:28:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919963984] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:15,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [22] total 26 [2025-01-09 15:28:15,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659553117] [2025-01-09 15:28:15,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:28:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:15,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:28:15,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:28:15,683 INFO L87 Difference]: Start difference. First operand 841 states and 1143 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:16,369 INFO L93 Difference]: Finished difference Result 2099 states and 2842 transitions. [2025-01-09 15:28:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:28:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:16,374 INFO L225 Difference]: With dead ends: 2099 [2025-01-09 15:28:16,374 INFO L226 Difference]: Without dead ends: 1261 [2025-01-09 15:28:16,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:28:16,376 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 90 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:16,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1058 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:28:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-01-09 15:28:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 785. [2025-01-09 15:28:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 684 states have (on average 1.29093567251462) internal successors, (883), 690 states have internal predecessors, (883), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:28:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1067 transitions. [2025-01-09 15:28:16,423 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1067 transitions. Word has length 160 [2025-01-09 15:28:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:16,424 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1067 transitions. [2025-01-09 15:28:16,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1067 transitions. [2025-01-09 15:28:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:16,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:16,425 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:16,432 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 (11)] Ended with exit code 0 [2025-01-09 15:28:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:16,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:16,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash -668429489, now seen corresponding path program 1 times [2025-01-09 15:28:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476194263] [2025-01-09 15:28:16,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:16,627 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-01-09 15:28:16,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:16,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-01-09 15:28:16,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:16,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:16,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:16,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:28:16,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:16,901 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-01-09 15:28:16,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:28:17,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:17,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-01-09 15:28:17,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:17,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 15:28:17,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:17,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2025-01-09 15:28:17,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 61 [2025-01-09 15:28:17,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:17,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 34 [2025-01-09 15:28:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 533 proven. 42 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-09 15:28:18,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:18,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476194263] [2025-01-09 15:28:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476194263] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2025-01-09 15:28:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143351248] [2025-01-09 15:28:18,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:18,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:18,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:18,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:18,272 INFO L87 Difference]: Start difference. First operand 785 states and 1067 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:18,688 INFO L93 Difference]: Finished difference Result 1691 states and 2294 transitions. [2025-01-09 15:28:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:28:18,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:18,691 INFO L225 Difference]: With dead ends: 1691 [2025-01-09 15:28:18,691 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 15:28:18,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:28:18,693 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 208 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:18,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 611 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 15:28:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 789. [2025-01-09 15:28:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 688 states have (on average 1.2863372093023255) internal successors, (885), 694 states have internal predecessors, (885), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:28:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1069 transitions. [2025-01-09 15:28:18,730 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1069 transitions. Word has length 160 [2025-01-09 15:28:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:18,730 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1069 transitions. [2025-01-09 15:28:18,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1069 transitions. [2025-01-09 15:28:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:18,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:18,732 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:18,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 15:28:18,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:18,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:18,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1417377299, now seen corresponding path program 1 times [2025-01-09 15:28:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:18,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549074744] [2025-01-09 15:28:18,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:18,933 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-01-09 15:28:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:18,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:18,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:28:19,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:19,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:19,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:19,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:19,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:28:19,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:19,242 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 19 treesize of output 1 [2025-01-09 15:28:19,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:28:19,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:19,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2025-01-09 15:28:19,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2025-01-09 15:28:19,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:19,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 26 [2025-01-09 15:28:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 383 proven. 27 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 15:28:19,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:19,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549074744] [2025-01-09 15:28:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549074744] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-01-09 15:28:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881846244] [2025-01-09 15:28:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:19,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:19,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:28:19,825 INFO L87 Difference]: Start difference. First operand 789 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:20,120 INFO L93 Difference]: Finished difference Result 1736 states and 2344 transitions. [2025-01-09 15:28:20,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:20,124 INFO L225 Difference]: With dead ends: 1736 [2025-01-09 15:28:20,125 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 15:28:20,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:28:20,126 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 95 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:20,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 476 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 15:28:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 700. [2025-01-09 15:28:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 613 states have (on average 1.2805872756933117) internal successors, (785), 617 states have internal predecessors, (785), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:28:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 941 transitions. [2025-01-09 15:28:20,171 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 941 transitions. Word has length 160 [2025-01-09 15:28:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:20,171 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 941 transitions. [2025-01-09 15:28:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 941 transitions. [2025-01-09 15:28:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:20,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:20,172 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:20,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-01-09 15:28:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:20,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -396418387, now seen corresponding path program 1 times [2025-01-09 15:28:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260835225] [2025-01-09 15:28:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:20,376 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-01-09 15:28:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:20,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:20,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 15:28:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:20,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:20,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:20,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:20,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:28:20,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:20,703 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-01-09 15:28:20,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:28:20,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:20,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 15:28:21,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2025-01-09 15:28:21,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2025-01-09 15:28:21,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 62 [2025-01-09 15:28:21,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 35 [2025-01-09 15:28:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 551 proven. 48 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-09 15:28:21,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:22,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260835225] [2025-01-09 15:28:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260835225] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2025-01-09 15:28:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574647760] [2025-01-09 15:28:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:22,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:22,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:22,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:22,035 INFO L87 Difference]: Start difference. First operand 700 states and 941 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:22,468 INFO L93 Difference]: Finished difference Result 1468 states and 1974 transitions. [2025-01-09 15:28:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:28:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:22,472 INFO L225 Difference]: With dead ends: 1468 [2025-01-09 15:28:22,472 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 15:28:22,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:28:22,474 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 74 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:22,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 816 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 15:28:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 680. [2025-01-09 15:28:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 593 states have (on average 1.2799325463743676) internal successors, (759), 597 states have internal predecessors, (759), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:28:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 915 transitions. [2025-01-09 15:28:22,508 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 915 transitions. Word has length 160 [2025-01-09 15:28:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:22,508 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 915 transitions. [2025-01-09 15:28:22,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 915 transitions. [2025-01-09 15:28:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:22,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:22,509 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:22,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 15:28:22,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:22,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:22,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1666865589, now seen corresponding path program 1 times [2025-01-09 15:28:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:22,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089625215] [2025-01-09 15:28:22,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:22,711 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-01-09 15:28:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:22,714 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:22,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 15:28:22,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:22,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:22,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:22,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:28:22,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:22,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:22,933 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 41 treesize of output 17 [2025-01-09 15:28:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:22,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:22,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089625215] [2025-01-09 15:28:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089625215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038059063] [2025-01-09 15:28:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:22,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:22,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:22,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:22,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:22,951 INFO L87 Difference]: Start difference. First operand 680 states and 915 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:23,350 INFO L93 Difference]: Finished difference Result 1497 states and 2009 transitions. [2025-01-09 15:28:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:23,354 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 15:28:23,354 INFO L226 Difference]: Without dead ends: 820 [2025-01-09 15:28:23,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:23,355 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 102 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:23,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 479 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-01-09 15:28:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 680. [2025-01-09 15:28:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 593 states have (on average 1.2765598650927488) internal successors, (757), 597 states have internal predecessors, (757), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:28:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 913 transitions. [2025-01-09 15:28:23,390 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 913 transitions. Word has length 160 [2025-01-09 15:28:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:23,390 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 913 transitions. [2025-01-09 15:28:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 913 transitions. [2025-01-09 15:28:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:28:23,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:23,391 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:23,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-01-09 15:28:23,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:23,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:23,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 256362445, now seen corresponding path program 1 times [2025-01-09 15:28:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555740116] [2025-01-09 15:28:23,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:23,592 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-01-09 15:28:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:23,594 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:23,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-01-09 15:28:23,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:28:23,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:28:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:23,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:28:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:23,891 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-01-09 15:28:23,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2025-01-09 15:28:23,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:23,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 15:28:24,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:24,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2025-01-09 15:28:24,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:24,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2025-01-09 15:28:24,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:24,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 61 [2025-01-09 15:28:25,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 34 [2025-01-09 15:28:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 519 proven. 48 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2025-01-09 15:28:25,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:25,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:25,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555740116] [2025-01-09 15:28:25,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555740116] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:25,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:25,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2025-01-09 15:28:25,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70010528] [2025-01-09 15:28:25,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:25,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:25,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:25,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:25,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:25,321 INFO L87 Difference]: Start difference. First operand 680 states and 913 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:25,761 INFO L93 Difference]: Finished difference Result 1452 states and 1945 transitions. [2025-01-09 15:28:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:28:25,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-01-09 15:28:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:25,765 INFO L225 Difference]: With dead ends: 1452 [2025-01-09 15:28:25,765 INFO L226 Difference]: Without dead ends: 775 [2025-01-09 15:28:25,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:28:25,766 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 140 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:25,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 624 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-01-09 15:28:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 564. [2025-01-09 15:28:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 498 states have (on average 1.2811244979919678) internal successors, (638), 500 states have internal predecessors, (638), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 15:28:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 756 transitions. [2025-01-09 15:28:25,794 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 756 transitions. Word has length 160 [2025-01-09 15:28:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:25,795 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 756 transitions. [2025-01-09 15:28:25,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 756 transitions. [2025-01-09 15:28:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:28:25,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:25,796 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:25,804 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 (16)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:26,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:26,000 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1962729461, now seen corresponding path program 1 times [2025-01-09 15:28:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254396637] [2025-01-09 15:28:26,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:26,001 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-01-09 15:28:26,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:26,002 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:26,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-01-09 15:28:26,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:28:26,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:28:26,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:28:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:26,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:26,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254396637] [2025-01-09 15:28:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254396637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984190229] [2025-01-09 15:28:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:26,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:26,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:26,222 INFO L87 Difference]: Start difference. First operand 564 states and 756 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:26,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:26,257 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2025-01-09 15:28:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:26,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:28:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:26,259 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 15:28:26,259 INFO L226 Difference]: Without dead ends: 576 [2025-01-09 15:28:26,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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-01-09 15:28:26,260 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:26,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-01-09 15:28:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2025-01-09 15:28:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 510 states have (on average 1.2745098039215685) internal successors, (650), 512 states have internal predecessors, (650), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 15:28:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 768 transitions. [2025-01-09 15:28:26,285 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 768 transitions. Word has length 162 [2025-01-09 15:28:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:26,285 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 768 transitions. [2025-01-09 15:28:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 768 transitions. [2025-01-09 15:28:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:28:26,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:26,286 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:26,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-01-09 15:28:26,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:26,490 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -953188588, now seen corresponding path program 1 times [2025-01-09 15:28:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:26,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467779525] [2025-01-09 15:28:26,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:26,491 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-01-09 15:28:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:26,492 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-01-09 15:28:26,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:28:26,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:28:26,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:26,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:26,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 15:28:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:26,819 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 14 treesize of output 10 [2025-01-09 15:28:26,890 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 36 treesize of output 29 [2025-01-09 15:28:27,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2025-01-09 15:28:27,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:27,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 35 [2025-01-09 15:28:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 375 proven. 15 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 15:28:27,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:28,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467779525] [2025-01-09 15:28:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467779525] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2025-01-09 15:28:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085246464] [2025-01-09 15:28:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:28:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:28,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:28:28,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:28:28,194 INFO L87 Difference]: Start difference. First operand 576 states and 768 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:29,157 INFO L93 Difference]: Finished difference Result 1389 states and 1842 transitions. [2025-01-09 15:28:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:28:29,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:28:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:29,160 INFO L225 Difference]: With dead ends: 1389 [2025-01-09 15:28:29,160 INFO L226 Difference]: Without dead ends: 816 [2025-01-09 15:28:29,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:28:29,161 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 108 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:29,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1513 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:28:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-01-09 15:28:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 812. [2025-01-09 15:28:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 712 states have (on average 1.2584269662921348) internal successors, (896), 716 states have internal predecessors, (896), 87 states have call successors, (87), 12 states have call predecessors, (87), 12 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 15:28:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1070 transitions. [2025-01-09 15:28:29,207 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1070 transitions. Word has length 162 [2025-01-09 15:28:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:29,207 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1070 transitions. [2025-01-09 15:28:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1070 transitions. [2025-01-09 15:28:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:28:29,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:29,208 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:29,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-01-09 15:28:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:28:29,408 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:29,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2061915030, now seen corresponding path program 1 times [2025-01-09 15:28:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818955396] [2025-01-09 15:28:29,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:29,409 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-01-09 15:28:29,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:29,412 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:28:29,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-01-09 15:28:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:28:29,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:28:29,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:29,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:29,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:28:29,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:29,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:29,660 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 40 treesize of output 16 [2025-01-09 15:28:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:29,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:29,677 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818955396] [2025-01-09 15:28:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818955396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:29,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:29,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:29,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764352930] [2025-01-09 15:28:29,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:29,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:29,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:29,678 INFO L87 Difference]: Start difference. First operand 812 states and 1070 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:30,034 INFO L93 Difference]: Finished difference Result 1954 states and 2570 transitions. [2025-01-09 15:28:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:30,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:28:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:30,039 INFO L225 Difference]: With dead ends: 1954 [2025-01-09 15:28:30,039 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 15:28:30,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:30,040 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 80 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 542 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 15:28:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 794. [2025-01-09 15:28:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 694 states have (on average 1.2478386167146973) internal successors, (866), 698 states have internal predecessors, (866), 87 states have call successors, (87), 12 states have call predecessors, (87), 12 states have return successors, (87), 83 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 15:28:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1040 transitions. [2025-01-09 15:28:30,081 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1040 transitions. Word has length 162 [2025-01-09 15:28:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1040 transitions. [2025-01-09 15:28:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1040 transitions. [2025-01-09 15:28:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:28:30,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:30,082 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:30,089 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 (19)] Ended with exit code 0 [2025-01-09 15:28:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-01-09 15:28:30,283 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 433014806, now seen corresponding path program 1 times [2025-01-09 15:28:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405391266] [2025-01-09 15:28:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:30,284 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-01-09 15:28:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:30,286 INFO L229 MonitoredProcess]: Starting monitored process 20 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-01-09 15:28:30,286 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 (20)] Waiting until timeout for monitored process [2025-01-09 15:28:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:28:30,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:28:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:30,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:28:30,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:30,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:30,523 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 40 treesize of output 16 [2025-01-09 15:28:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:28:30,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:30,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:30,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405391266] [2025-01-09 15:28:30,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405391266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:30,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499725283] [2025-01-09 15:28:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:30,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:30,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:30,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:30,538 INFO L87 Difference]: Start difference. First operand 794 states and 1040 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:30,934 INFO L93 Difference]: Finished difference Result 1685 states and 2202 transitions. [2025-01-09 15:28:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2025-01-09 15:28:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:30,937 INFO L225 Difference]: With dead ends: 1685 [2025-01-09 15:28:30,937 INFO L226 Difference]: Without dead ends: 894 [2025-01-09 15:28:30,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:30,938 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 100 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:30,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 551 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-09 15:28:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 818. [2025-01-09 15:28:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 704 states have (on average 1.2357954545454546) internal successors, (870), 709 states have internal predecessors, (870), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 15:28:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1068 transitions. [2025-01-09 15:28:30,994 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1068 transitions. Word has length 162 [2025-01-09 15:28:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:30,994 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1068 transitions. [2025-01-09 15:28:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 15:28:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1068 transitions. [2025-01-09 15:28:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 15:28:30,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:30,995 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:31,002 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 (20)] Ended with exit code 0 [2025-01-09 15:28:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-01-09 15:28:31,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1728733332, now seen corresponding path program 1 times [2025-01-09 15:28:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735811692] [2025-01-09 15:28:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:31,197 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-01-09 15:28:31,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:31,198 INFO L229 MonitoredProcess]: Starting monitored process 21 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-01-09 15:28:31,199 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 (21)] Waiting until timeout for monitored process [2025-01-09 15:28:31,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 15:28:31,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 15:28:31,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:31,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:31,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 15:28:31,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:31,480 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 14 treesize of output 10 [2025-01-09 15:28:31,505 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 25 treesize of output 24 [2025-01-09 15:28:31,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:31,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-01-09 15:28:31,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:31,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2025-01-09 15:28:32,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:32,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 38 [2025-01-09 15:28:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-09 15:28:32,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:32,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735811692] [2025-01-09 15:28:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735811692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:28:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197928651] [2025-01-09 15:28:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:28:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:28:32,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:28:32,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:28:32,150 INFO L87 Difference]: Start difference. First operand 818 states and 1068 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:28:33,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:33,802 INFO L93 Difference]: Finished difference Result 1769 states and 2312 transitions. [2025-01-09 15:28:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:28:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2025-01-09 15:28:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:33,806 INFO L225 Difference]: With dead ends: 1769 [2025-01-09 15:28:33,806 INFO L226 Difference]: Without dead ends: 954 [2025-01-09 15:28:33,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:28:33,807 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 277 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:33,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1084 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:28:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-01-09 15:28:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 806. [2025-01-09 15:28:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 692 states have (on average 1.2369942196531791) internal successors, (856), 697 states have internal predecessors, (856), 99 states have call successors, (99), 14 states have call predecessors, (99), 14 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 15:28:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1054 transitions. [2025-01-09 15:28:33,860 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1054 transitions. Word has length 162 [2025-01-09 15:28:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1054 transitions. [2025-01-09 15:28:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 states have internal predecessors, (74), 4 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 15:28:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1054 transitions. [2025-01-09 15:28:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 15:28:33,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:33,861 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:28:33,869 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 (21)] Ended with exit code 0 [2025-01-09 15:28:34,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-01-09 15:28:34,062 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -881681042, now seen corresponding path program 1 times [2025-01-09 15:28:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:28:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534761036] [2025-01-09 15:28:34,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:34,063 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-01-09 15:28:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:28:34,064 INFO L229 MonitoredProcess]: Starting monitored process 22 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-01-09 15:28:34,065 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 (22)] Waiting until timeout for monitored process [2025-01-09 15:28:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 15:28:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 15:28:34,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:34,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:28:34,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:34,413 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-01-09 15:28:34,990 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 121 treesize of output 61 [2025-01-09 15:28:35,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:35,186 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 203 treesize of output 77 [2025-01-09 15:28:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-01-09 15:28:35,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:35,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534761036] [2025-01-09 15:28:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534761036] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [693330050] [2025-01-09 15:28:35,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:35,401 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:28:35,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:28:35,403 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:28:35,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-01-09 15:28:35,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.