./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.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-41.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 cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:44,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:44,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:39:44,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:44,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:44,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:44,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:44,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:44,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:44,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:44,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:44,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:44,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:44,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:44,488 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:44,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:44,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:44,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:44,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:39:44,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:39:44,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:44,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:44,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:44,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:44,491 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 -> cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 [2025-02-06 03:39:44,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:44,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:44,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:44,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:44,729 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:44,730 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-41.i [2025-02-06 03:39:45,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7371720/683ed17f0e9c40ba846e290731b44a3d/FLAG49a4c2fc5 [2025-02-06 03:39:46,213 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:46,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-02-06 03:39:46,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7371720/683ed17f0e9c40ba846e290731b44a3d/FLAG49a4c2fc5 [2025-02-06 03:39:46,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e7371720/683ed17f0e9c40ba846e290731b44a3d [2025-02-06 03:39:46,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:46,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:46,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:46,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:46,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:46,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3c5206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46, skipping insertion in model container [2025-02-06 03:39:46,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:46,642 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-41.i[916,929] [2025-02-06 03:39:46,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:46,708 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:46,718 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-41.i[916,929] [2025-02-06 03:39:46,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:46,754 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:46,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46 WrapperNode [2025-02-06 03:39:46,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:46,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:46,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:46,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:46,760 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:39:46" (1/1) ... [2025-02-06 03:39:46,776 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:39:46" (1/1) ... [2025-02-06 03:39:46,805 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2025-02-06 03:39:46,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:46,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:46,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:46,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:46,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,847 INFO L175 MemorySlicer]: Split 111 memory accesses to 13 slices as follows [2, 8, 12, 14, 6, 11, 6, 5, 10, 7, 7, 17, 6]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:39:46,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:46,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:46,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:46,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:46,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (1/1) ... [2025-02-06 03:39:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:46,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:46,913 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:39:46,918 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:39:46,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:39:46,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:39:46,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:39:46,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:39:46,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:39:46,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:39:46,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:46,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:39:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:46,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:47,089 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:47,090 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:47,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-02-06 03:39:47,410 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:47,411 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:47,421 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:47,422 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:47,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:47 BoogieIcfgContainer [2025-02-06 03:39:47,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:47,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:47,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:47,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:47,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:46" (1/3) ... [2025-02-06 03:39:47,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2ffc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:47, skipping insertion in model container [2025-02-06 03:39:47,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:46" (2/3) ... [2025-02-06 03:39:47,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a2ffc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:47, skipping insertion in model container [2025-02-06 03:39:47,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:47" (3/3) ... [2025-02-06 03:39:47,431 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-41.i [2025-02-06 03:39:47,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:47,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:47,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:47,502 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;@1328aab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:47,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:39:47,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:39:47,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:47,515 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:47,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1589906888, now seen corresponding path program 1 times [2025-02-06 03:39:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:47,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033885436] [2025-02-06 03:39:47,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:47,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:39:47,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:39:47,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:39:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033885436] [2025-02-06 03:39:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033885436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762505988] [2025-02-06 03:39:47,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:47,803 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:39:47,806 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:39:47,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:39:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:39:48,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:48,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:48,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:39:48,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762505988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:39:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595923649] [2025-02-06 03:39:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:48,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:48,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:48,055 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:39:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:48,077 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-02-06 03:39:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 03:39:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:48,083 INFO L225 Difference]: With dead ends: 166 [2025-02-06 03:39:48,084 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 03:39:48,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:39:48,090 INFO L435 NwaCegarLoop]: 115 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, 115 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:39:48,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 03:39:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 03:39:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:39:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-06 03:39:48,118 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-02-06 03:39:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:48,118 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-06 03:39:48,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:39:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-06 03:39:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:39:48,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:48,121 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:48,128 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:39:48,322 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:39:48,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2086249782, now seen corresponding path program 1 times [2025-02-06 03:39:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941989099] [2025-02-06 03:39:48,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:48,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:39:48,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:39:48,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:48,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:39:48,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:48,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941989099] [2025-02-06 03:39:48,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941989099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:48,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:48,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546442298] [2025-02-06 03:39:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:48,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:48,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:48,860 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:48,948 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2025-02-06 03:39:48,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 03:39:48,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:48,952 INFO L225 Difference]: With dead ends: 195 [2025-02-06 03:39:48,952 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 03:39:48,952 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:39:48,953 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 44 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:48,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 522 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 03:39:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-02-06 03:39:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 96 states have internal predecessors, (127), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:39:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-02-06 03:39:48,972 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 114 [2025-02-06 03:39:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-02-06 03:39:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-02-06 03:39:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:39:48,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:48,976 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:48,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:39:48,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1862207717, now seen corresponding path program 1 times [2025-02-06 03:39:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:48,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559320633] [2025-02-06 03:39:48,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:49,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:39:49,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:39:49,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:49,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:39:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559320633] [2025-02-06 03:39:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559320633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:49,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:49,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:39:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661385550] [2025-02-06 03:39:49,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:49,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:39:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:49,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:39:49,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:39:49,208 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:49,221 INFO L93 Difference]: Finished difference Result 198 states and 275 transitions. [2025-02-06 03:39:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:39:49,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-02-06 03:39:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:49,224 INFO L225 Difference]: With dead ends: 198 [2025-02-06 03:39:49,224 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 03:39:49,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:39:49,225 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:49,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:49,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 03:39:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 03:39:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:39:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-02-06 03:39:49,238 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 115 [2025-02-06 03:39:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:49,239 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-02-06 03:39:49,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-02-06 03:39:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:39:49,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:49,240 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:49,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:39:49,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash 146374056, now seen corresponding path program 1 times [2025-02-06 03:39:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992277100] [2025-02-06 03:39:49,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:49,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:39:49,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:39:49,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:49,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:39:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:50,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992277100] [2025-02-06 03:39:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992277100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:39:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212747232] [2025-02-06 03:39:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:50,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:39:50,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:39:50,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:50,641 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:39:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:51,018 INFO L93 Difference]: Finished difference Result 248 states and 338 transitions. [2025-02-06 03:39:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:39:51,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-02-06 03:39:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:51,021 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:39:51,022 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 03:39:51,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:39:51,024 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 278 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:51,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 782 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 03:39:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2025-02-06 03:39:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 125 states have internal predecessors, (154), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 214 transitions. [2025-02-06 03:39:51,050 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 214 transitions. Word has length 116 [2025-02-06 03:39:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:51,050 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 214 transitions. [2025-02-06 03:39:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-06 03:39:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 214 transitions. [2025-02-06 03:39:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:39:51,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:51,055 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:39:51,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:51,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1953828519, now seen corresponding path program 1 times [2025-02-06 03:39:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502611857] [2025-02-06 03:39:51,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:39:51,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:39:51,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:51,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:39:51,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:39:51,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:39:51,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:51,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:51,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:39:51,237 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:39:51,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:39:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:39:51,242 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 03:39:51,366 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:39:51,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:39:51 BoogieIcfgContainer [2025-02-06 03:39:51,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:39:51,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:39:51,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:39:51,372 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:39:51,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:47" (3/4) ... [2025-02-06 03:39:51,374 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:39:51,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:39:51,376 INFO L158 Benchmark]: Toolchain (without parser) took 4861.18ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 117.0MB in the beginning and 279.3MB in the end (delta: -162.4MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-02-06 03:39:51,376 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:51,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.90ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 102.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:39:51,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.13ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 99.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:51,377 INFO L158 Benchmark]: Boogie Preprocessor took 70.49ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 95.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:51,377 INFO L158 Benchmark]: IcfgBuilder took 543.16ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 62.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:39:51,377 INFO L158 Benchmark]: TraceAbstraction took 3946.27ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 61.8MB in the beginning and 279.4MB in the end (delta: -217.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-02-06 03:39:51,378 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 377.5MB. Free memory was 279.4MB in the beginning and 279.3MB in the end (delta: 75.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:51,379 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.60ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.90ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 102.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.13ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 99.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.49ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 95.8MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 543.16ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 62.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3946.27ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 61.8MB in the beginning and 279.4MB in the end (delta: -217.6MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 377.5MB. Free memory was 279.4MB in the beginning and 279.3MB in the end (delta: 75.0kB). 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 someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L22] signed char var_1_1 = -16; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_5 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char* var_1_5_Pointer = &(var_1_5); [L26] signed char var_1_6 = -8; [L26] signed char var_1_6 = -8; [L27] signed char* var_1_6_Pointer = &(var_1_6); [L28] signed char var_1_7 = 5; [L28] signed char var_1_7 = 5; [L29] signed char* var_1_7_Pointer = &(var_1_7); [L30] unsigned short int var_1_8 = 2; [L30] unsigned short int var_1_8 = 2; [L31] unsigned short int* var_1_8_Pointer = &(var_1_8); [L32] unsigned char var_1_11 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] double var_1_12 = 8.5; [L34] double var_1_12 = 8.5; [L35] double* var_1_12_Pointer = &(var_1_12); [L36] double var_1_13 = 999999999999.6; [L36] double var_1_13 = 999999999999.6; [L37] double* var_1_13_Pointer = &(var_1_13); [L38] signed long int var_1_14 = 10; [L38] signed long int var_1_14 = 10; [L39] signed long int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = -1; [L40] signed char var_1_15 = -1; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 16; [L42] unsigned char var_1_16 = 16; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); [L44] unsigned char var_1_17 = 64; [L44] unsigned char var_1_17 = 64; [L45] unsigned char* var_1_17_Pointer = &(var_1_17); [L46] signed char last_1_var_1_1 = -16; VAL [isInitial=0, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR \read(var_1_1) [L104] last_1_var_1_1 = var_1_1 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L81] var_1_5 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L84] var_1_6 = __VERIFIER_nondet_char() [L85] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L87] var_1_7 = __VERIFIER_nondet_char() [L88] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L93] var_1_13 = __VERIFIER_nondet_double() [L94] EXPR \read(var_1_13) [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L94] EXPR \read(var_1_13) [L94] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L94] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L96] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L96] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L97] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L99] var_1_17 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L100] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L100] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L101] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L115] RET updateVariables() [L116] CALL step() [L50] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L50] COND TRUE (*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1) [L51] EXPR \read(*var_1_17_Pointer) [L51] (*(var_1_16_Pointer)) = (*(var_1_17_Pointer)) [L53] EXPR \read(*var_1_13_Pointer) [L53] (*(var_1_12_Pointer)) = ((*(var_1_13_Pointer)) - 8.3) [L54] EXPR \read(*var_1_13_Pointer) [L54] EXPR \read(*var_1_12_Pointer) [L54] unsigned char stepLocal_1 = (*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)); [L55] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L55] COND TRUE (*(var_1_5_Pointer)) && stepLocal_1 [L56] EXPR \read(*var_1_16_Pointer) [L56] (*(var_1_14_Pointer)) = (*(var_1_16_Pointer)) [L60] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L60] COND TRUE (*(var_1_5_Pointer)) [L61] EXPR \read(*var_1_16_Pointer) [L61] EXPR \read(*var_1_16_Pointer) [L61] (*(var_1_8_Pointer)) = ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))) [L69] EXPR \read(*var_1_8_Pointer) [L69] EXPR \read(*var_1_16_Pointer) [L69] unsigned long int stepLocal_0 = ((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer)); [L70] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L70] COND FALSE !(stepLocal_0 > (*(var_1_8_Pointer))) [L77] EXPR \read(*var_1_6_Pointer) [L77] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR \read(*var_1_8_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer)))) [L107] EXPR \read(*var_1_1_Pointer) [L107] EXPR \read(*var_1_6_Pointer) [L107] EXPR ((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) [L107] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))) [L107] EXPR \read(*var_1_8_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR \read(*var_1_16_Pointer) [L107] EXPR (*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) [L107] EXPR \read(*var_1_12_Pointer) [L107] EXPR \read(*var_1_13_Pointer) [L107] EXPR ((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR (((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107] EXPR ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L107-L108] return ((((((((*(var_1_8_Pointer)) & 0u) * (*(var_1_16_Pointer))) > (*(var_1_8_Pointer))) ? ((*(var_1_5_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) ((16 + (*(var_1_6_Pointer))) + (*(var_1_7_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer)))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_6_Pointer))))) && ((*(var_1_5_Pointer)) ? ((*(var_1_8_Pointer)) == ((unsigned short int) ((*(var_1_16_Pointer)) + (*(var_1_16_Pointer))))) : ((((*(var_1_16_Pointer)) > (*(var_1_14_Pointer))) || (*(var_1_11_Pointer))) ? ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer)))) : ((*(var_1_8_Pointer)) == ((unsigned short int) (*(var_1_16_Pointer))))))) && ((*(var_1_12_Pointer)) == ((double) ((*(var_1_13_Pointer)) - 8.3)))) && (((*(var_1_5_Pointer)) && ((*(var_1_13_Pointer)) >= (*(var_1_12_Pointer)))) ? ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) : ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_15_Pointer)))))) && (((*(var_1_5_Pointer)) && (last_1_var_1_1 <= last_1_var_1_1)) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : 1) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, 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_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 1630 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1111 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 519 mSDtfsCounter, 255 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1794/1820 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:39:51,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.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 cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:53,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:53,363 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:39:53,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:53,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:53,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:53,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:53,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:53,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:53,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:53,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:53,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:53,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:53,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:53,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:53,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:53,387 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:39:53,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:53,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:53,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:53,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:53,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:53,388 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 -> cf57f6cdcf870de2612fde58ee5c1f342ba08bbc54728c19b9bea815b9a3fde0 [2025-02-06 03:39:53,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:53,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:53,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:53,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:53,622 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:53,624 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-41.i [2025-02-06 03:39:54,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae20f7d5/ec1200b7c3124006963819186b94820c/FLAG44e31a907 [2025-02-06 03:39:54,988 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:54,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-41.i [2025-02-06 03:39:54,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae20f7d5/ec1200b7c3124006963819186b94820c/FLAG44e31a907 [2025-02-06 03:39:55,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ae20f7d5/ec1200b7c3124006963819186b94820c [2025-02-06 03:39:55,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:55,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:55,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:55,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:55,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:55,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774fac32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55, skipping insertion in model container [2025-02-06 03:39:55,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:55,154 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-41.i[916,929] [2025-02-06 03:39:55,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:55,234 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:55,244 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-41.i[916,929] [2025-02-06 03:39:55,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:55,281 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:55,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55 WrapperNode [2025-02-06 03:39:55,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:55,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:55,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:55,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:55,288 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:39:55" (1/1) ... [2025-02-06 03:39:55,300 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:39:55" (1/1) ... [2025-02-06 03:39:55,333 INFO L138 Inliner]: procedures = 36, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-02-06 03:39:55,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:55,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:55,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:55,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:55,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,383 INFO L175 MemorySlicer]: Split 111 memory accesses to 13 slices as follows [2, 8, 12, 14, 6, 11, 6, 5, 10, 7, 7, 17, 6]. 15 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1]. [2025-02-06 03:39:55,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:55,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:55,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:55,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:55,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (1/1) ... [2025-02-06 03:39:55,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:55,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:55,476 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:39:55,479 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:39:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:39:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:39:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:39:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:39:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:39:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:39:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:39:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:39:55,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:39:55,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:39:55,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:39:55,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:39:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:55,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:55,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:39:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:39:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:39:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:39:55,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:39:55,697 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:55,699 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:56,426 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-02-06 03:39:56,463 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:56,463 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:56,471 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:56,471 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:56,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:56 BoogieIcfgContainer [2025-02-06 03:39:56,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:56,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:56,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:56,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:56,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:55" (1/3) ... [2025-02-06 03:39:56,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579affe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:56, skipping insertion in model container [2025-02-06 03:39:56,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:55" (2/3) ... [2025-02-06 03:39:56,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579affe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:56, skipping insertion in model container [2025-02-06 03:39:56,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:56" (3/3) ... [2025-02-06 03:39:56,499 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-41.i [2025-02-06 03:39:56,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:56,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:56,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:56,558 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;@33d4bbd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:56,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:39:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:39:56,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:56,569 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:56,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1589906888, now seen corresponding path program 1 times [2025-02-06 03:39:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790674732] [2025-02-06 03:39:56,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:56,585 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:39:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:56,587 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:39:56,589 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:39:56,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:39:56,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:39:56,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:56,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:56,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:56,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-06 03:39:56,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:56,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:56,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790674732] [2025-02-06 03:39:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790674732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:39:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83863044] [2025-02-06 03:39:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:56,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:56,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:56,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:56,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:56,961 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:39:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:56,976 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-02-06 03:39:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:56,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 03:39:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:56,981 INFO L225 Difference]: With dead ends: 166 [2025-02-06 03:39:56,982 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 03:39:56,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:56,985 INFO L435 NwaCegarLoop]: 115 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, 115 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:39:56,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 03:39:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 03:39:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:39:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-06 03:39:57,017 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-02-06 03:39:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:57,017 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-06 03:39:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:39:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-06 03:39:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 03:39:57,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:57,020 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:57,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:39:57,220 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:39:57,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:57,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2086249782, now seen corresponding path program 1 times [2025-02-06 03:39:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116972215] [2025-02-06 03:39:57,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:57,222 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:39:57,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:57,225 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:39:57,226 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:39:57,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 03:39:57,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 03:39:57,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:57,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:57,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:39:57,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:58,340 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:39:58,405 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 72 treesize of output 52 [2025-02-06 03:39:58,411 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 42 treesize of output 30 [2025-02-06 03:39:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 16 proven. 162 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-06 03:39:58,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:39:58,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116972215] [2025-02-06 03:39:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116972215] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-02-06 03:39:58,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158955186] [2025-02-06 03:39:58,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:58,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:39:58,591 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:58,707 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2025-02-06 03:39:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 03:39:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:58,709 INFO L225 Difference]: With dead ends: 195 [2025-02-06 03:39:58,709 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 03:39:58,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:39:58,710 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 44 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:58,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 522 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 03:39:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-02-06 03:39:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 96 states have internal predecessors, (127), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:39:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-02-06 03:39:58,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 114 [2025-02-06 03:39:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:58,720 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-02-06 03:39:58,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-02-06 03:39:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 03:39:58,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:58,722 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 03:39:58,922 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:39:58,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:58,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1862207717, now seen corresponding path program 1 times [2025-02-06 03:39:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095991379] [2025-02-06 03:39:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:58,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:39:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:58,927 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:39:58,928 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:39:59,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 03:39:59,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 03:39:59,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:59,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 03:39:59,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:39:59,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:59,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:59,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095991379] [2025-02-06 03:39:59,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095991379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:59,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:59,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:39:59,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404200400] [2025-02-06 03:39:59,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:59,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:39:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:59,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:39:59,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:39:59,203 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:59,218 INFO L93 Difference]: Finished difference Result 198 states and 275 transitions. [2025-02-06 03:39:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:39:59,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-02-06 03:39:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:59,222 INFO L225 Difference]: With dead ends: 198 [2025-02-06 03:39:59,223 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 03:39:59,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:39:59,227 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:59,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 03:39:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 03:39:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:39:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2025-02-06 03:39:59,239 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 115 [2025-02-06 03:39:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:59,242 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2025-02-06 03:39:59,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:39:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2025-02-06 03:39:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 03:39:59,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:59,244 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:59,251 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:39:59,444 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:39:59,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 146374056, now seen corresponding path program 1 times [2025-02-06 03:39:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273592716] [2025-02-06 03:39:59,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:39:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:59,448 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:39:59,450 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:39:59,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 03:39:59,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 03:39:59,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:59,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:59,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:39:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:59,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:59,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-02-06 03:39:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 03:39:59,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:59,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273592716] [2025-02-06 03:39:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273592716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49083728] [2025-02-06 03:39:59,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:59,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:59,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:59,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:59,896 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:00,424 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2025-02-06 03:40:00,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:40:00,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-06 03:40:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:00,426 INFO L225 Difference]: With dead ends: 167 [2025-02-06 03:40:00,426 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 03:40:00,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:00,427 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 76 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:00,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 356 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:40:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 03:40:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-02-06 03:40:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.25) internal successors, (85), 69 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 03:40:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2025-02-06 03:40:00,442 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 116 [2025-02-06 03:40:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:00,443 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2025-02-06 03:40:00,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:40:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2025-02-06 03:40:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:00,444 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:40:00,644 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:40:00,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:00,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1409367322, now seen corresponding path program 1 times [2025-02-06 03:40:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281403216] [2025-02-06 03:40:00,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:00,646 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:40:00,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:00,648 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:40:00,649 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:40:00,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:00,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:40:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 03:40:01,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2025-02-06 03:40:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:01,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:01,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:01,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281403216] [2025-02-06 03:40:01,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281403216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:01,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:01,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:40:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782795511] [2025-02-06 03:40:01,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:01,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:01,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:01,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:40:01,034 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:01,379 INFO L93 Difference]: Finished difference Result 248 states and 335 transitions. [2025-02-06 03:40:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:01,382 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:40:01,382 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 03:40:01,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:40:01,383 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:01,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 712 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:40:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 03:40:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2025-02-06 03:40:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 125 states have internal predecessors, (152), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:40:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 212 transitions. [2025-02-06 03:40:01,398 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 212 transitions. Word has length 118 [2025-02-06 03:40:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:01,399 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 212 transitions. [2025-02-06 03:40:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 212 transitions. [2025-02-06 03:40:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:01,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:01,400 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:01,410 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:40:01,601 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:40:01,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 398087141, now seen corresponding path program 1 times [2025-02-06 03:40:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:01,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631631261] [2025-02-06 03:40:01,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:01,602 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:40:01,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:01,604 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:40:01,604 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:40:01,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:15,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:15,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:40:15,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:17,699 INFO L224 Elim1Store]: Index analysis took 165 ms [2025-02-06 03:40:17,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 03:40:31,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:31,536 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 210 treesize of output 140 [2025-02-06 03:40:31,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:31,564 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 298 treesize of output 148 [2025-02-06 03:40:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 5 proven. 207 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:40:33,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:43,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631631261] [2025-02-06 03:40:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631631261] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-02-06 03:40:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619263891] [2025-02-06 03:40:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:43,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:43,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:40:43,014 INFO L87 Difference]: Start difference. First operand 158 states and 212 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:49,973 INFO L93 Difference]: Finished difference Result 425 states and 567 transitions. [2025-02-06 03:40:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 03:40:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:49,988 INFO L225 Difference]: With dead ends: 425 [2025-02-06 03:40:49,988 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 03:40:49,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:40:49,989 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 63 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:49,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 601 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 03:40:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 03:40:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2025-02-06 03:40:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2407407407407407) internal successors, (268), 220 states have internal predecessors, (268), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:40:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 360 transitions. [2025-02-06 03:40:50,019 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 360 transitions. Word has length 118 [2025-02-06 03:40:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:50,019 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 360 transitions. [2025-02-06 03:40:50,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:40:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 360 transitions. [2025-02-06 03:40:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 03:40:50,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:50,020 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:50,037 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:40:50,221 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:40:50,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash 609438054, now seen corresponding path program 1 times [2025-02-06 03:40:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946005647] [2025-02-06 03:40:50,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:50,222 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:40:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:50,224 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:40:50,225 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:40:50,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 03:40:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 03:40:50,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:50,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:50,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:40:50,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:53,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:53,030 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 291 treesize of output 141 [2025-02-06 03:40:55,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 03:40:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 253 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:40:55,852 INFO L312 TraceCheckSpWp]: Computing backward predicates...