./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.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 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:42:39,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:42:39,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:42:39,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:42:39,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:42:39,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:42:39,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:42:39,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:42:39,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:42:39,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:42:39,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:42:39,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:42:39,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:42:39,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:42:39,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:42:39,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:42:39,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:42:39,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:42:39,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:42:39,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:39,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:42:39,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:42:39,392 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 -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2025-02-06 03:42:39,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:42:39,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:42:39,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:42:39,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:42:39,632 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:42:39,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:42:40,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d742c6fd1/1df4dd9ebe4941aebc9dff8e182e0450/FLAG05d68d0c8 [2025-02-06 03:42:41,095 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:42:41,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:42:41,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d742c6fd1/1df4dd9ebe4941aebc9dff8e182e0450/FLAG05d68d0c8 [2025-02-06 03:42:41,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d742c6fd1/1df4dd9ebe4941aebc9dff8e182e0450 [2025-02-06 03:42:41,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:42:41,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:42:41,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:41,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:42:41,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:42:41,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41, skipping insertion in model container [2025-02-06 03:42:41,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:42:41,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-02-06 03:42:41,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:41,547 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:42:41,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-02-06 03:42:41,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:41,614 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:42:41,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41 WrapperNode [2025-02-06 03:42:41,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:41,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:41,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:42:41,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:42:41,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,652 INFO L138 Inliner]: procedures = 29, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 708 [2025-02-06 03:42:41,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:41,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:42:41,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:42:41,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:42:41,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,679 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:42:41,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:42:41,701 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:42:41,701 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:42:41,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:42:41,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (1/1) ... [2025-02-06 03:42:41,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:41,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:41,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:42:41,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-02-06 03:42:41,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:42:41,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 03:42:41,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 03:42:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:42:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:42:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:42:41,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-02-06 03:42:41,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:42:41,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:42:41,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 03:42:41,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:42:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:42:41,908 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:42:41,909 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:42:42,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:42:42,308 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-02-06 03:42:42,308 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:42:42,342 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:42:42,343 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:42:42,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:42 BoogieIcfgContainer [2025-02-06 03:42:42,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:42:42,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:42:42,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:42:42,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:42:42,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:42:41" (1/3) ... [2025-02-06 03:42:42,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d7940d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:42:42, skipping insertion in model container [2025-02-06 03:42:42,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:41" (2/3) ... [2025-02-06 03:42:42,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d7940d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:42:42, skipping insertion in model container [2025-02-06 03:42:42,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:42" (3/3) ... [2025-02-06 03:42:42,350 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:42:42,361 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:42:42,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:42:42,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:42:42,406 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;@24944700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:42:42,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:42:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:42,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:42,419 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:42,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 459598875, now seen corresponding path program 1 times [2025-02-06 03:42:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432887865] [2025-02-06 03:42:42,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:42,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:42,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:42:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432887865] [2025-02-06 03:42:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432887865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441269767] [2025-02-06 03:42:42,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:42,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:42,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:42,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:42,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:42:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:42,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:42,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:42:42,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:42:43,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:43,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441269767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:42:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802791405] [2025-02-06 03:42:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:42:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:43,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:42:43,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:42:43,030 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:42:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:43,057 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:42:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:42:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:42:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:43,063 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:42:43,063 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:42:43,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:42:43,067 INFO L435 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:43,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:42:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:42:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:42:43,098 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:42:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:43,098 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:42:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:42:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:42:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:43,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:43,101 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:43,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:42:43,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:42:43,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:43,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:43,303 INFO L85 PathProgramCache]: Analyzing trace with hash 674485477, now seen corresponding path program 1 times [2025-02-06 03:42:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:43,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82532489] [2025-02-06 03:42:43,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:43,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:43,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:43,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:43,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82532489] [2025-02-06 03:42:43,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82532489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:43,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668601137] [2025-02-06 03:42:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:43,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:43,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:43,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:43,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:42:43,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:44,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:44,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:44,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:44,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:42:44,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:44,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668601137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:42:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656217603] [2025-02-06 03:42:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:44,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:44,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:44,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:44,108 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:44,151 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2025-02-06 03:42:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:42:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:44,153 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:42:44,153 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 03:42:44,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:44,155 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:44,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 03:42:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-02-06 03:42:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 03:42:44,163 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 03:42:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:44,164 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 03:42:44,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 03:42:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:44,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:44,165 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:44,173 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-02-06 03:42:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:44,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 381082470, now seen corresponding path program 1 times [2025-02-06 03:42:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164575620] [2025-02-06 03:42:44,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:44,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:44,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:44,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:44,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164575620] [2025-02-06 03:42:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164575620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043878590] [2025-02-06 03:42:44,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:44,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:44,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:44,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:44,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:42:44,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:44,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:44,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:44,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:44,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:42:44,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:44,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:44,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043878590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:44,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:42:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098831514] [2025-02-06 03:42:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:44,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:44,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:44,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:44,867 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:44,890 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-02-06 03:42:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:44,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:42:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:44,892 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:42:44,893 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:42:44,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:44,894 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:44,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:42:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 03:42:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 03:42:44,902 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-02-06 03:42:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:44,902 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 03:42:44,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 03:42:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:44,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:44,904 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:44,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:45,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:45,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1426371993, now seen corresponding path program 1 times [2025-02-06 03:42:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482945774] [2025-02-06 03:42:45,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:45,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:45,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:45,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:45,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:45,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482945774] [2025-02-06 03:42:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482945774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:45,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004286212] [2025-02-06 03:42:45,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:45,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:45,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:42:45,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:45,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:42:45,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:45,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004286212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:42:45,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983546142] [2025-02-06 03:42:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:45,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:45,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:45,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:45,652 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:45,671 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-02-06 03:42:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:42:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:45,672 INFO L225 Difference]: With dead ends: 278 [2025-02-06 03:42:45,672 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:42:45,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:45,673 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:45,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:42:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-02-06 03:42:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-02-06 03:42:45,684 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-02-06 03:42:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:45,684 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-02-06 03:42:45,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-02-06 03:42:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:45,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:45,686 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:45,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:42:45,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:45,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash -538868312, now seen corresponding path program 1 times [2025-02-06 03:42:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326405032] [2025-02-06 03:42:45,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:45,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:45,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:45,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326405032] [2025-02-06 03:42:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326405032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636964699] [2025-02-06 03:42:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:46,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:46,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:42:46,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:46,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:46,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:46,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:46,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:42:46,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:46,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:46,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636964699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:42:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104232455] [2025-02-06 03:42:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:46,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:46,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:46,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:46,363 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:46,390 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-02-06 03:42:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:42:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:46,393 INFO L225 Difference]: With dead ends: 282 [2025-02-06 03:42:46,393 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:42:46,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:46,395 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:46,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:42:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-02-06 03:42:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-02-06 03:42:46,402 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2025-02-06 03:42:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:46,403 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-02-06 03:42:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-02-06 03:42:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:42:46,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:46,404 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:46,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:42:46,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:46,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:46,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -537944791, now seen corresponding path program 1 times [2025-02-06 03:42:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:46,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-02-06 03:42:46,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:46,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:46,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:46,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:46,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220062582] [2025-02-06 03:42:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220062582] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323263650] [2025-02-06 03:42:46,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:46,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:46,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:42:46,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:42:47,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:42:47,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:47,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:47,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:42:47,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:47,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323263650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:47,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:42:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330106862] [2025-02-06 03:42:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:47,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:42:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:42:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:47,031 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:47,057 INFO L93 Difference]: Finished difference Result 285 states and 412 transitions. [2025-02-06 03:42:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:42:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:42:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:47,059 INFO L225 Difference]: With dead ends: 285 [2025-02-06 03:42:47,059 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:42:47,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:47,060 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:47,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:42:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 03:42:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-02-06 03:42:47,070 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2025-02-06 03:42:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:47,070 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-02-06 03:42:47,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-02-06 03:42:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:42:47,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:47,072 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:47,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:47,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 03:42:47,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -857867001, now seen corresponding path program 1 times [2025-02-06 03:42:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-02-06 03:42:47,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:47,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:42:47,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:42:47,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:47,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:47,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-02-06 03:42:47,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926247405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:47,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800574919] [2025-02-06 03:42:47,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:47,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:47,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:42:48,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:42:48,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:42:48,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:48,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:48,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:42:48,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:48,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:42:48,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 03:42:48,537 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 37 treesize of output 25 [2025-02-06 03:42:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:42:48,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:42:48,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-02-06 03:42:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800574919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:42:48,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:42:48,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2025-02-06 03:42:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342847085] [2025-02-06 03:42:48,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:42:48,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:42:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:48,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:42:48,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:42:48,896 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2025-02-06 03:42:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:49,278 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2025-02-06 03:42:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:42:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) Word has length 158 [2025-02-06 03:42:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:49,280 INFO L225 Difference]: With dead ends: 299 [2025-02-06 03:42:49,280 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 03:42:49,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:42:49,281 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 661 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:49,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 807 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:42:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 03:42:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-02-06 03:42:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:42:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2025-02-06 03:42:49,289 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 158 [2025-02-06 03:42:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:49,290 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2025-02-06 03:42:49,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.357142857142857) internal successors, (103), 16 states have internal predecessors, (103), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2025-02-06 03:42:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2025-02-06 03:42:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:42:49,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:49,291 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:49,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:49,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:49,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1854939354, now seen corresponding path program 1 times [2025-02-06 03:42:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255410771] [2025-02-06 03:42:49,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:49,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:42:49,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:42:49,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:49,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:49,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255410771] [2025-02-06 03:42:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255410771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:49,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:42:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784526112] [2025-02-06 03:42:49,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:49,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:42:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:49,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:42:49,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:49,887 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:49,962 INFO L93 Difference]: Finished difference Result 451 states and 631 transitions. [2025-02-06 03:42:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:42:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:42:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:49,965 INFO L225 Difference]: With dead ends: 451 [2025-02-06 03:42:49,965 INFO L226 Difference]: Without dead ends: 301 [2025-02-06 03:42:49,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:42:49,966 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 128 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:49,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1279 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-06 03:42:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 295. [2025-02-06 03:42:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 252 states have (on average 1.3571428571428572) internal successors, (342), 252 states have internal predecessors, (342), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:42:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 414 transitions. [2025-02-06 03:42:49,984 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 414 transitions. Word has length 158 [2025-02-06 03:42:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:49,984 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 414 transitions. [2025-02-06 03:42:49,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 414 transitions. [2025-02-06 03:42:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:42:49,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:49,986 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:42:49,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1618047496, now seen corresponding path program 1 times [2025-02-06 03:42:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949167221] [2025-02-06 03:42:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:50,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:42:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:42:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949167221] [2025-02-06 03:42:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949167221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:50,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:50,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125592162] [2025-02-06 03:42:50,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:50,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:50,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:50,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:50,240 INFO L87 Difference]: Start difference. First operand 295 states and 414 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:50,293 INFO L93 Difference]: Finished difference Result 586 states and 821 transitions. [2025-02-06 03:42:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:42:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:50,296 INFO L225 Difference]: With dead ends: 586 [2025-02-06 03:42:50,296 INFO L226 Difference]: Without dead ends: 435 [2025-02-06 03:42:50,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:50,297 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 173 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:50,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1118 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-02-06 03:42:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 320. [2025-02-06 03:42:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 277 states have (on average 1.3682310469314078) internal successors, (379), 277 states have internal predecessors, (379), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:42:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2025-02-06 03:42:50,323 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 160 [2025-02-06 03:42:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:50,324 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2025-02-06 03:42:50,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2025-02-06 03:42:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:42:50,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:50,326 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:50,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:42:50,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:50,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1968847433, now seen corresponding path program 1 times [2025-02-06 03:42:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:50,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467769730] [2025-02-06 03:42:50,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:50,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:42:50,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:42:50,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:50,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467769730] [2025-02-06 03:42:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467769730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:42:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064348457] [2025-02-06 03:42:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:50,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:42:50,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:50,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:42:50,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:50,821 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:50,944 INFO L93 Difference]: Finished difference Result 644 states and 907 transitions. [2025-02-06 03:42:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:42:50,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:42:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:50,947 INFO L225 Difference]: With dead ends: 644 [2025-02-06 03:42:50,948 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 03:42:50,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:42:50,948 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 184 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:50,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1315 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 03:42:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 320. [2025-02-06 03:42:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 277 states have (on average 1.3682310469314078) internal successors, (379), 277 states have internal predecessors, (379), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:42:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 451 transitions. [2025-02-06 03:42:50,970 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 451 transitions. Word has length 160 [2025-02-06 03:42:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:50,971 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 451 transitions. [2025-02-06 03:42:50,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 451 transitions. [2025-02-06 03:42:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:42:50,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:50,973 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:42:50,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:50,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1017122602, now seen corresponding path program 1 times [2025-02-06 03:42:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070051584] [2025-02-06 03:42:50,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:50,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:42:51,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:42:51,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:51,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070051584] [2025-02-06 03:42:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070051584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:42:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178572614] [2025-02-06 03:42:51,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:42:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:51,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:42:51,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:51,446 INFO L87 Difference]: Start difference. First operand 320 states and 451 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:42:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:51,604 INFO L93 Difference]: Finished difference Result 691 states and 969 transitions. [2025-02-06 03:42:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:42:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 160 [2025-02-06 03:42:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:51,606 INFO L225 Difference]: With dead ends: 691 [2025-02-06 03:42:51,606 INFO L226 Difference]: Without dead ends: 374 [2025-02-06 03:42:51,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:42:51,607 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 295 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:51,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 969 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-06 03:42:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2025-02-06 03:42:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 320 states have (on average 1.35625) internal successors, (434), 321 states have internal predecessors, (434), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:42:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2025-02-06 03:42:51,629 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 160 [2025-02-06 03:42:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:51,629 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2025-02-06 03:42:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:42:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2025-02-06 03:42:51,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:42:51,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:51,631 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:51,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:42:51,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1310525609, now seen corresponding path program 1 times [2025-02-06 03:42:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124729231] [2025-02-06 03:42:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:51,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:42:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:42:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:51,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124729231] [2025-02-06 03:42:51,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124729231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:51,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:42:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667995697] [2025-02-06 03:42:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:51,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:42:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:51,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:42:51,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:42:51,828 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:51,929 INFO L93 Difference]: Finished difference Result 968 states and 1335 transitions. [2025-02-06 03:42:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:42:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:42:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:51,933 INFO L225 Difference]: With dead ends: 968 [2025-02-06 03:42:51,933 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 03:42:51,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:42:51,934 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 149 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:51,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1279 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 03:42:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 519. [2025-02-06 03:42:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 444 states have (on average 1.34009009009009) internal successors, (595), 446 states have internal predecessors, (595), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:42:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 715 transitions. [2025-02-06 03:42:52,039 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 715 transitions. Word has length 160 [2025-02-06 03:42:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:52,039 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 715 transitions. [2025-02-06 03:42:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 715 transitions. [2025-02-06 03:42:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:42:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:52,042 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:52,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:42:52,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1452753483, now seen corresponding path program 1 times [2025-02-06 03:42:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:52,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984962803] [2025-02-06 03:42:52,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:52,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:42:52,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:42:52,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984962803] [2025-02-06 03:42:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984962803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:52,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:42:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647409317] [2025-02-06 03:42:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:52,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:42:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:52,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:42:52,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:42:52,777 INFO L87 Difference]: Start difference. First operand 519 states and 715 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:42:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:52,983 INFO L93 Difference]: Finished difference Result 530 states and 728 transitions. [2025-02-06 03:42:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:42:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 163 [2025-02-06 03:42:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:52,987 INFO L225 Difference]: With dead ends: 530 [2025-02-06 03:42:52,988 INFO L226 Difference]: Without dead ends: 528 [2025-02-06 03:42:52,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:42:52,988 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 286 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:52,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 911 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:42:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-06 03:42:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-02-06 03:42:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 453 states have (on average 1.3333333333333333) internal successors, (604), 455 states have internal predecessors, (604), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:42:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 724 transitions. [2025-02-06 03:42:53,025 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 724 transitions. Word has length 163 [2025-02-06 03:42:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 724 transitions. [2025-02-06 03:42:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 9 states have internal predecessors, (76), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-06 03:42:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 724 transitions. [2025-02-06 03:42:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:42:53,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:53,027 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:53,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:42:53,028 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1451829962, now seen corresponding path program 1 times [2025-02-06 03:42:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921566324] [2025-02-06 03:42:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:42:53,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:42:53,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:53,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921566324] [2025-02-06 03:42:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921566324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560886504] [2025-02-06 03:42:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:53,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:53,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:53,193 INFO L87 Difference]: Start difference. First operand 528 states and 724 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:53,280 INFO L93 Difference]: Finished difference Result 1024 states and 1397 transitions. [2025-02-06 03:42:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:42:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:53,282 INFO L225 Difference]: With dead ends: 1024 [2025-02-06 03:42:53,282 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 03:42:53,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:53,284 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 135 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:53,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 548 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 03:42:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 516. [2025-02-06 03:42:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 449 states have (on average 1.329621380846325) internal successors, (597), 451 states have internal predecessors, (597), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:42:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 697 transitions. [2025-02-06 03:42:53,319 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 697 transitions. Word has length 163 [2025-02-06 03:42:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:53,320 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 697 transitions. [2025-02-06 03:42:53,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 697 transitions. [2025-02-06 03:42:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:42:53,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:53,322 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:42:53,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:53,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -564326281, now seen corresponding path program 1 times [2025-02-06 03:42:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425275352] [2025-02-06 03:42:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:53,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:42:53,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:42:53,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:53,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425275352] [2025-02-06 03:42:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425275352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:42:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:42:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830526235] [2025-02-06 03:42:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:42:53,506 INFO L87 Difference]: Start difference. First operand 516 states and 697 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:53,564 INFO L93 Difference]: Finished difference Result 988 states and 1334 transitions. [2025-02-06 03:42:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:42:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:53,567 INFO L225 Difference]: With dead ends: 988 [2025-02-06 03:42:53,567 INFO L226 Difference]: Without dead ends: 516 [2025-02-06 03:42:53,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:42:53,568 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:53,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 647 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-06 03:42:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-02-06 03:42:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 449 states have (on average 1.3229398663697105) internal successors, (594), 451 states have internal predecessors, (594), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:42:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 694 transitions. [2025-02-06 03:42:53,606 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 694 transitions. Word has length 163 [2025-02-06 03:42:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:53,606 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 694 transitions. [2025-02-06 03:42:53,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 694 transitions. [2025-02-06 03:42:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:42:53,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:53,608 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:53,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:42:53,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1923186552, now seen corresponding path program 1 times [2025-02-06 03:42:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287115105] [2025-02-06 03:42:53,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:53,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:42:53,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:42:53,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:53,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:42:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:42:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287115105] [2025-02-06 03:42:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287115105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:42:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683322236] [2025-02-06 03:42:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:42:53,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:53,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:42:53,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:42:53,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:42:54,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:42:54,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:54,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:42:54,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:42:54,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:42:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:42:54,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:42:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683322236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:42:54,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:42:54,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:42:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418294491] [2025-02-06 03:42:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:42:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:42:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:42:54,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:42:54,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:54,026 INFO L87 Difference]: Start difference. First operand 516 states and 694 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:42:54,071 INFO L93 Difference]: Finished difference Result 997 states and 1340 transitions. [2025-02-06 03:42:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:42:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:42:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:42:54,074 INFO L225 Difference]: With dead ends: 997 [2025-02-06 03:42:54,074 INFO L226 Difference]: Without dead ends: 525 [2025-02-06 03:42:54,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:42:54,075 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:42:54,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:42:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-06 03:42:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-02-06 03:42:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 458 states have (on average 1.3165938864628821) internal successors, (603), 460 states have internal predecessors, (603), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 03:42:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 703 transitions. [2025-02-06 03:42:54,128 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 703 transitions. Word has length 163 [2025-02-06 03:42:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:42:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 703 transitions. [2025-02-06 03:42:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:42:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 703 transitions. [2025-02-06 03:42:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 03:42:54,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:42:54,130 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:54,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:42:54,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 03:42:54,331 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:42:54,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:42:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2121166842, now seen corresponding path program 1 times [2025-02-06 03:42:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:42:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226587202] [2025-02-06 03:42:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:42:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:42:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:42:54,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:42:54,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:54,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:42:54,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:42:54,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:42:54,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:42:54,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:42:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:42:54,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:42:54,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:42:54,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:42:54,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:42:54,557 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:42:54,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:42:54,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:42:54 BoogieIcfgContainer [2025-02-06 03:42:54,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:42:54,762 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:42:54,762 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:42:54,762 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:42:54,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:42:42" (3/4) ... [2025-02-06 03:42:54,764 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:42:54,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:42:54,765 INFO L158 Benchmark]: Toolchain (without parser) took 13386.12ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 105.5MB in the beginning and 378.6MB in the end (delta: -273.1MB). Peak memory consumption was 154.5MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,765 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:42:54,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.09ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.02ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:42:54,766 INFO L158 Benchmark]: Boogie Preprocessor took 47.72ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 80.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,766 INFO L158 Benchmark]: IcfgBuilder took 642.20ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 100.7MB in the end (delta: -19.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,766 INFO L158 Benchmark]: TraceAbstraction took 12417.01ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 100.0MB in the beginning and 382.9MB in the end (delta: -282.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,766 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 570.4MB. Free memory was 382.9MB in the beginning and 378.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:42:54,767 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.09ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.02ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.72ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 80.9MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 642.20ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 100.7MB in the end (delta: -19.8MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12417.01ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 100.0MB in the beginning and 382.9MB in the end (delta: -282.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 570.4MB. Free memory was 382.9MB in the beginning and 378.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 8.3; [L24] float var_1_2 = 8.3; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 2.25; [L26] float var_1_3 = 2.25; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 10.3; [L28] float var_1_4 = 10.3; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] signed long int var_1_7 = 128; [L32] signed long int var_1_7 = 128; [L33] signed long int* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 9.8; [L34] float var_1_8 = 9.8; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] unsigned long int var_1_13 = 1; [L36] unsigned long int var_1_13 = 1; [L37] unsigned long int* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 32; [L38] unsigned long int var_1_14 = 32; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = -10; [L40] signed char var_1_15 = -10; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 16; [L42] signed char var_1_16 = 16; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] signed char var_1_17 = 25; [L44] signed char var_1_17 = 25; [L45] signed char* var_1_17_Pointer = &(var_1_17); [L46] signed char var_1_18 = 1; [L46] signed char var_1_18 = 1; [L47] signed char* var_1_18_Pointer = &(var_1_18); [L48] signed char var_1_19 = 0; [L48] signed char var_1_19 = 0; [L49] signed char* var_1_19_Pointer = &(var_1_19); [L50] signed char var_1_20 = 32; [L50] signed char var_1_20 = 32; [L51] signed char* var_1_20_Pointer = &(var_1_20); [L52] signed short int var_1_21 = 256; [L52] signed short int var_1_21 = 256; [L53] signed short int* var_1_21_Pointer = &(var_1_21); [L54] signed char var_1_22 = 16; [L54] signed char var_1_22 = 16; [L55] signed char* var_1_22_Pointer = &(var_1_22); [L56] unsigned char var_1_23 = 0; [L56] unsigned char var_1_23 = 0; [L57] unsigned char* var_1_23_Pointer = &(var_1_23); [L58] signed short int last_1_var_1_21 = 256; VAL [isInitial=0, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L111] EXPR \read(var_1_21) [L111] last_1_var_1_21 = var_1_21 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L82] var_1_3 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L84] var_1_4 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] var_1_8 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L91] var_1_14 = __VERIFIER_nondet_ulong() [L92] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L94] var_1_16 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L97] var_1_17 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L100] var_1_18 = __VERIFIER_nondet_char() [L101] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L103] var_1_19 = __VERIFIER_nondet_char() [L104] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L106] var_1_20 = __VERIFIER_nondet_char() [L107] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L122] RET updateVariables() [L123] CALL step() [L62] EXPR \read(*var_1_14_Pointer) [L62] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L63] (*(var_1_21_Pointer)) = last_1_var_1_21 [L64] EXPR \read(*var_1_16_Pointer) [L64] (*(var_1_22_Pointer)) = (*(var_1_16_Pointer)) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_23_Pointer)) = (*(var_1_6_Pointer)) [L66] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR \read(*var_1_3_Pointer) [L66] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] COND FALSE !(((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) [L69] EXPR \read(*var_1_22_Pointer) [L69] signed char stepLocal_0 = (*(var_1_22_Pointer)); [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR \read(*var_1_21_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=2, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] COND FALSE !(stepLocal_0 != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] COND TRUE (*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] (*(var_1_7_Pointer)) = ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR \read(*var_1_22_Pointer) [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114-L115] return (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2092 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2092 mSDsluCounter, 12708 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9309 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 3399 mSDtfsCounter, 964 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1563 GetRequests, 1435 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=13, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 423 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3968 NumberOfCodeBlocks, 3968 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3934 ConstructedInterpolants, 0 QuantifiedInterpolants, 9440 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5819 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 14673/15300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:42:54,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.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 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:42:56,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:42:56,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:42:56,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:42:56,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:42:56,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:42:56,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:42:56,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:42:56,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:42:56,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:42:56,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:42:56,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:42:56,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:42:56,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:42:56,878 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:42:56,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:42:56,879 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:42:56,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:42:56,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:42:56,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:42:56,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:42:56,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:42:56,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:56,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:42:56,881 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:42:56,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:42:56,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:42:56,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:42:56,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:42:56,882 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 -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2025-02-06 03:42:57,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:42:57,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:42:57,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:42:57,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:42:57,157 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:42:57,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:42:58,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2b18f159/f0116a3ea1364107be21ddfad9d911e0/FLAGbeeb802c8 [2025-02-06 03:42:58,652 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:42:58,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:42:58,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2b18f159/f0116a3ea1364107be21ddfad9d911e0/FLAGbeeb802c8 [2025-02-06 03:42:58,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2b18f159/f0116a3ea1364107be21ddfad9d911e0 [2025-02-06 03:42:58,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:42:58,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:42:58,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:58,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:42:58,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:42:58,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:58" (1/1) ... [2025-02-06 03:42:58,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469f2ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:58, skipping insertion in model container [2025-02-06 03:42:58,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:42:58" (1/1) ... [2025-02-06 03:42:59,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:42:59,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-02-06 03:42:59,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:59,171 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:42:59,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-02-06 03:42:59,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:42:59,234 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:42:59,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59 WrapperNode [2025-02-06 03:42:59,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:42:59,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:59,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:42:59,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:42:59,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,275 INFO L138 Inliner]: procedures = 36, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 703 [2025-02-06 03:42:59,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:42:59,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:42:59,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:42:59,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:42:59,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,326 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:42:59,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:42:59,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:42:59,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:42:59,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:42:59,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (1/1) ... [2025-02-06 03:42:59,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:42:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:42:59,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:42:59,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:42:59,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:42:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-02-06 03:42:59,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-02-06 03:42:59,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-02-06 03:42:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2025-02-06 03:42:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2025-02-06 03:42:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:42:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:42:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-02-06 03:42:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:42:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:42:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2025-02-06 03:42:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-02-06 03:42:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:42:59,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:42:59,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:42:59,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:42:59,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-02-06 03:42:59,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:42:59,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2025-02-06 03:42:59,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2025-02-06 03:42:59,683 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:42:59,684 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:43:01,588 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:43:01,642 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-02-06 03:43:01,642 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:43:01,650 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:43:01,650 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:43:01,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:43:01 BoogieIcfgContainer [2025-02-06 03:43:01,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:43:01,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:43:01,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:43:01,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:43:01,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:42:58" (1/3) ... [2025-02-06 03:43:01,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf1bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:43:01, skipping insertion in model container [2025-02-06 03:43:01,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:42:59" (2/3) ... [2025-02-06 03:43:01,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf1bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:43:01, skipping insertion in model container [2025-02-06 03:43:01,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:43:01" (3/3) ... [2025-02-06 03:43:01,656 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2025-02-06 03:43:01,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:43:01,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:43:01,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:43:01,733 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;@58911deb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:43:01,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:43:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:43:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:43:01,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:01,751 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:01,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 459598875, now seen corresponding path program 1 times [2025-02-06 03:43:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420776264] [2025-02-06 03:43:01,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:01,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:01,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:43:02,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:43:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:43:02,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:02,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:02,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:43:02,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-06 03:43:02,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:02,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420776264] [2025-02-06 03:43:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420776264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:43:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821243505] [2025-02-06 03:43:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:43:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:02,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:43:02,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:43:02,381 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:43:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:02,418 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:43:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:43:02,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:43:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:02,430 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:43:02,431 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:43:02,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:43:02,438 INFO L435 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:02,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:43:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:43:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:43:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:43:02,488 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:43:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:02,488 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:43:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:43:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:43:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:43:02,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:02,491 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:02,505 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 (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:43:02,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:02,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:02,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 674485477, now seen corresponding path program 1 times [2025-02-06 03:43:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:02,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667445260] [2025-02-06 03:43:02,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:02,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:02,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:43:02,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:43:03,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:43:03,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:03,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:03,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:43:03,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:03,234 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:03,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667445260] [2025-02-06 03:43:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667445260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:43:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493070060] [2025-02-06 03:43:03,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:03,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:43:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:03,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:43:03,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:03,239 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:03,281 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2025-02-06 03:43:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:43:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:43:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:03,285 INFO L225 Difference]: With dead ends: 269 [2025-02-06 03:43:03,285 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:43:03,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:43:03,286 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:03,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:43:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 03:43:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:43:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 03:43:03,305 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 03:43:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:03,307 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 03:43:03,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 03:43:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:43:03,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:03,311 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:03,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:43:03,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:03,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:03,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 354563267, now seen corresponding path program 1 times [2025-02-06 03:43:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960653812] [2025-02-06 03:43:03,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:03,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:03,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:03,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:43:03,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:43:04,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:43:04,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:04,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:04,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:43:04,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:04,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:43:04,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:43:04,681 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 33 treesize of output 21 [2025-02-06 03:43:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:43:04,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:43:04,978 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:43:04,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:43:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:43:05,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960653812] [2025-02-06 03:43:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960653812] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:43:05,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:43:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-06 03:43:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491566996] [2025-02-06 03:43:05,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:43:05,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:43:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:05,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:43:05,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:05,084 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:43:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:05,960 INFO L93 Difference]: Finished difference Result 279 states and 404 transitions. [2025-02-06 03:43:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:43:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 158 [2025-02-06 03:43:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:05,962 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:43:05,962 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:43:05,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:43:05,963 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 571 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:05,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 784 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:43:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:43:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-02-06 03:43:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:43:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2025-02-06 03:43:05,977 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 158 [2025-02-06 03:43:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:05,978 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2025-02-06 03:43:05,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.0) internal successors, (99), 13 states have internal predecessors, (99), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:43:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2025-02-06 03:43:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:43:05,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:05,979 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:05,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:43:06,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:06,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:06,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash -642509086, now seen corresponding path program 1 times [2025-02-06 03:43:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:06,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983432819] [2025-02-06 03:43:06,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:06,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:06,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:06,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:43:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:43:06,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:43:06,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:06,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:43:06,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:07,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:43:07,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:43:07,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:43:07,621 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 33 treesize of output 21 [2025-02-06 03:43:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:43:07,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:43:08,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:43:08,548 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 53 treesize of output 52 [2025-02-06 03:43:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:43:08,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:08,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983432819] [2025-02-06 03:43:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983432819] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:43:08,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:43:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-02-06 03:43:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312185203] [2025-02-06 03:43:08,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:43:08,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 03:43:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:08,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 03:43:08,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:43:08,756 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2025-02-06 03:43:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:10,678 INFO L93 Difference]: Finished difference Result 425 states and 608 transitions. [2025-02-06 03:43:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:43:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) Word has length 158 [2025-02-06 03:43:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:10,680 INFO L225 Difference]: With dead ends: 425 [2025-02-06 03:43:10,680 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 03:43:10,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:43:10,685 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 846 mSDsluCounter, 2555 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:10,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 2753 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 03:43:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 03:43:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 273. [2025-02-06 03:43:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.3879310344827587) internal successors, (322), 232 states have internal predecessors, (322), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:43:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 394 transitions. [2025-02-06 03:43:10,720 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 394 transitions. Word has length 158 [2025-02-06 03:43:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:10,720 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 394 transitions. [2025-02-06 03:43:10,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 19 states have internal predecessors, (136), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2025-02-06 03:43:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 394 transitions. [2025-02-06 03:43:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:43:10,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:10,722 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:10,740 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-02-06 03:43:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:10,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:10,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1464489532, now seen corresponding path program 1 times [2025-02-06 03:43:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957710261] [2025-02-06 03:43:10,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:10,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:10,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:43:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:43:11,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:43:11,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:11,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:11,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:43:11,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:11,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:43:11,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:43:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-06 03:43:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:43:11,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:43:12,010 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:43:12,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:43:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:43:12,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957710261] [2025-02-06 03:43:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957710261] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:43:12,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:43:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-02-06 03:43:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787822794] [2025-02-06 03:43:12,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:43:12,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:43:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:12,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:43:12,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:12,111 INFO L87 Difference]: Start difference. First operand 273 states and 394 transitions. Second operand has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:43:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:13,046 INFO L93 Difference]: Finished difference Result 419 states and 601 transitions. [2025-02-06 03:43:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:43:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 160 [2025-02-06 03:43:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:13,052 INFO L225 Difference]: With dead ends: 419 [2025-02-06 03:43:13,052 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:43:13,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-02-06 03:43:13,053 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 714 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:13,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 785 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:43:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:43:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2025-02-06 03:43:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 232 states have internal predecessors, (321), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:43:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 393 transitions. [2025-02-06 03:43:13,085 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 393 transitions. Word has length 160 [2025-02-06 03:43:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:13,087 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 393 transitions. [2025-02-06 03:43:13,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.181818181818182) internal successors, (90), 13 states have internal predecessors, (90), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-06 03:43:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 393 transitions. [2025-02-06 03:43:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:43:13,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:13,090 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:13,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:43:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:13,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1113689595, now seen corresponding path program 1 times [2025-02-06 03:43:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979223997] [2025-02-06 03:43:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:13,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:13,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:43:13,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:43:13,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:43:13,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:13,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:13,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:43:13,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:43:14,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 03:43:14,098 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 12 treesize of output 8 [2025-02-06 03:43:14,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:43:14,186 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 33 treesize of output 21 [2025-02-06 03:43:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:43:14,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:43:14,408 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 26 treesize of output 22 [2025-02-06 03:43:14,411 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 03:43:14,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:43:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2025-02-06 03:43:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:14,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979223997] [2025-02-06 03:43:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979223997] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:43:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:43:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2025-02-06 03:43:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185958475] [2025-02-06 03:43:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:14,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:43:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:14,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:43:14,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:43:14,524 INFO L87 Difference]: Start difference. First operand 273 states and 393 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:15,226 INFO L93 Difference]: Finished difference Result 613 states and 879 transitions. [2025-02-06 03:43:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:43:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:15,231 INFO L225 Difference]: With dead ends: 613 [2025-02-06 03:43:15,231 INFO L226 Difference]: Without dead ends: 475 [2025-02-06 03:43:15,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:43:15,232 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 176 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:15,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1504 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:43:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-02-06 03:43:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 299. [2025-02-06 03:43:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 258 states have internal predecessors, (360), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:43:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 432 transitions. [2025-02-06 03:43:15,251 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 432 transitions. Word has length 160 [2025-02-06 03:43:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:15,251 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 432 transitions. [2025-02-06 03:43:15,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 432 transitions. [2025-02-06 03:43:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:43:15,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:15,252 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:15,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:43:15,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:15,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash -98095341, now seen corresponding path program 1 times [2025-02-06 03:43:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295719083] [2025-02-06 03:43:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:15,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:15,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-06 03:43:15,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:43:15,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:43:15,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:15,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:15,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:43:15,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:15,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 03:43:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:15,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:15,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295719083] [2025-02-06 03:43:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295719083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:43:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721202134] [2025-02-06 03:43:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:15,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:43:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:15,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:43:15,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:43:15,989 INFO L87 Difference]: Start difference. First operand 299 states and 432 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:16,079 INFO L93 Difference]: Finished difference Result 645 states and 928 transitions. [2025-02-06 03:43:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:43:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:43:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:16,085 INFO L225 Difference]: With dead ends: 645 [2025-02-06 03:43:16,085 INFO L226 Difference]: Without dead ends: 349 [2025-02-06 03:43:16,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:43:16,086 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 136 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:16,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 821 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:43:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-06 03:43:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 348. [2025-02-06 03:43:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 298 states have (on average 1.3825503355704698) internal successors, (412), 299 states have internal predecessors, (412), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-06 03:43:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 496 transitions. [2025-02-06 03:43:16,119 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 496 transitions. Word has length 160 [2025-02-06 03:43:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:16,119 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 496 transitions. [2025-02-06 03:43:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 496 transitions. [2025-02-06 03:43:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:43:16,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:16,121 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:16,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-06 03:43:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:16,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:16,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:16,322 INFO L85 PathProgramCache]: Analyzing trace with hash -391498348, now seen corresponding path program 1 times [2025-02-06 03:43:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:16,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517227871] [2025-02-06 03:43:16,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:16,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:16,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:16,325 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:16,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 03:43:16,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:43:16,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:43:16,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:16,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:16,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:43:16,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:16,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:43:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:17,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:17,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:17,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517227871] [2025-02-06 03:43:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517227871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:17,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:43:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954584355] [2025-02-06 03:43:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:43:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:43:17,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:43:17,016 INFO L87 Difference]: Start difference. First operand 348 states and 496 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:17,877 INFO L93 Difference]: Finished difference Result 902 states and 1277 transitions. [2025-02-06 03:43:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:43:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:43:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:17,881 INFO L225 Difference]: With dead ends: 902 [2025-02-06 03:43:17,881 INFO L226 Difference]: Without dead ends: 594 [2025-02-06 03:43:17,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:43:17,882 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 149 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:17,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1274 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:43:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-06 03:43:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 486. [2025-02-06 03:43:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 415 states have (on average 1.3662650602409638) internal successors, (567), 417 states have internal predecessors, (567), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:43:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 687 transitions. [2025-02-06 03:43:17,912 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 687 transitions. Word has length 160 [2025-02-06 03:43:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:17,912 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 687 transitions. [2025-02-06 03:43:17,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 687 transitions. [2025-02-06 03:43:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:43:17,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:17,914 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:17,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:43:18,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:18,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1452753483, now seen corresponding path program 1 times [2025-02-06 03:43:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:18,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695563041] [2025-02-06 03:43:18,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:18,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:18,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:18,123 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:18,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:43:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:43:18,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:43:18,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:18,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:43:18,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:18,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:43:19,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2025-02-06 03:43:19,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-02-06 03:43:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-06 03:43:19,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:43:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:19,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:19,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695563041] [2025-02-06 03:43:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695563041] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:43:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:43:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2025-02-06 03:43:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303847338] [2025-02-06 03:43:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:19,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:43:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:19,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:43:19,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:43:19,251 INFO L87 Difference]: Start difference. First operand 486 states and 687 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:19,687 INFO L93 Difference]: Finished difference Result 513 states and 712 transitions. [2025-02-06 03:43:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:43:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:43:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:19,690 INFO L225 Difference]: With dead ends: 513 [2025-02-06 03:43:19,690 INFO L226 Difference]: Without dead ends: 511 [2025-02-06 03:43:19,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:43:19,690 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 111 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:19,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 805 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:43:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-02-06 03:43:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-02-06 03:43:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 436 states have (on average 1.348623853211009) internal successors, (588), 438 states have internal predecessors, (588), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 03:43:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 708 transitions. [2025-02-06 03:43:19,727 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 708 transitions. Word has length 163 [2025-02-06 03:43:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 708 transitions. [2025-02-06 03:43:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 708 transitions. [2025-02-06 03:43:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:43:19,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:19,732 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:19,757 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 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:43:19,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:19,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1451829962, now seen corresponding path program 1 times [2025-02-06 03:43:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62926699] [2025-02-06 03:43:19,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:19,938 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:19,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:43:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:43:20,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:43:20,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:20,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:20,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:43:20,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:21,468 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 70 treesize of output 34 [2025-02-06 03:43:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:21,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:21,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62926699] [2025-02-06 03:43:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62926699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231125975] [2025-02-06 03:43:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:21,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:43:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:21,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:43:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:43:21,505 INFO L87 Difference]: Start difference. First operand 511 states and 708 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:25,677 INFO L93 Difference]: Finished difference Result 1472 states and 2039 transitions. [2025-02-06 03:43:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:43:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:25,688 INFO L225 Difference]: With dead ends: 1472 [2025-02-06 03:43:25,688 INFO L226 Difference]: Without dead ends: 1005 [2025-02-06 03:43:25,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:25,689 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 459 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:25,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 773 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 03:43:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-02-06 03:43:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 757. [2025-02-06 03:43:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 608 states have (on average 1.3157894736842106) internal successors, (800), 612 states have internal predecessors, (800), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:43:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1040 transitions. [2025-02-06 03:43:25,764 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1040 transitions. Word has length 163 [2025-02-06 03:43:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1040 transitions. [2025-02-06 03:43:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1040 transitions. [2025-02-06 03:43:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:43:25,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:25,768 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:25,789 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-02-06 03:43:25,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:25,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1122064201, now seen corresponding path program 1 times [2025-02-06 03:43:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081028728] [2025-02-06 03:43:25,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:25,979 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:25,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:43:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:43:26,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:43:26,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:26,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:26,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 03:43:26,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:27,659 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 70 treesize of output 34 [2025-02-06 03:43:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:43:27,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:43:27,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:43:27,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081028728] [2025-02-06 03:43:27,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081028728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:43:27,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:43:27,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:43:27,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435760386] [2025-02-06 03:43:27,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:43:27,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:43:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:43:27,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:43:27,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:43:27,694 INFO L87 Difference]: Start difference. First operand 757 states and 1040 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:43:33,067 INFO L93 Difference]: Finished difference Result 1682 states and 2319 transitions. [2025-02-06 03:43:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:43:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:43:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:43:33,080 INFO L225 Difference]: With dead ends: 1682 [2025-02-06 03:43:33,081 INFO L226 Difference]: Without dead ends: 1005 [2025-02-06 03:43:33,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:43:33,083 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 445 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:43:33,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 771 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 03:43:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-02-06 03:43:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 835. [2025-02-06 03:43:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 686 states have (on average 1.3309037900874636) internal successors, (913), 690 states have internal predecessors, (913), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 03:43:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1153 transitions. [2025-02-06 03:43:33,164 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1153 transitions. Word has length 163 [2025-02-06 03:43:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:43:33,164 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1153 transitions. [2025-02-06 03:43:33,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:43:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1153 transitions. [2025-02-06 03:43:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:43:33,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:43:33,166 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:43:33,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 (12)] Ended with exit code 0 [2025-02-06 03:43:33,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:33,370 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:43:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:43:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1091044394, now seen corresponding path program 1 times [2025-02-06 03:43:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:43:33,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939713015] [2025-02-06 03:43:33,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:43:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:43:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:43:33,374 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:43:33,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:43:33,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:43:33,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:43:33,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:43:33,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:43:33,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 03:43:33,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:43:38,522 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 70 treesize of output 34 [2025-02-06 03:43:38,708 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 91 treesize of output 43 [2025-02-06 03:43:38,978 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 70 treesize of output 34 [2025-02-06 03:43:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-02-06 03:43:39,266 INFO L312 TraceCheckSpWp]: Computing backward predicates...