./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.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 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:21:06,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:21:06,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:21:06,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:21:06,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:21:06,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:21:06,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:21:06,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:21:06,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:21:06,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:21:06,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:21:06,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:21:06,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:21:06,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:21:06,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:21:06,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:21:06,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:21:06,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:21:06,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:06,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:06,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:21:06,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:21:06,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:21:06,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:21:06,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:21:06,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:21:06,697 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 -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2025-01-09 15:21:06,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:21:06,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:21:06,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:21:06,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:21:06,940 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:21:06,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:08,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71936e9f/19a3c22b3cc14442858e7999dc1f645e/FLAG9498d7a43 [2025-01-09 15:21:08,319 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:21:08,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:08,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71936e9f/19a3c22b3cc14442858e7999dc1f645e/FLAG9498d7a43 [2025-01-09 15:21:08,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71936e9f/19a3c22b3cc14442858e7999dc1f645e [2025-01-09 15:21:08,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:21:08,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:21:08,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:21:08,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:21:08,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:21:08,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56965ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08, skipping insertion in model container [2025-01-09 15:21:08,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:21:08,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2025-01-09 15:21:08,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:21:08,800 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:21:08,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2025-01-09 15:21:08,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:21:08,861 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:21:08,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08 WrapperNode [2025-01-09 15:21:08,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:21:08,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:21:08,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:21:08,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:21:08,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,894 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2025-01-09 15:21:08,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:21:08,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:21:08,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:21:08,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:21:08,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,927 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2025-01-09 15:21:08,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:21:08,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:21:08,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:21:08,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:21:08,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (1/1) ... [2025-01-09 15:21:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:21:08,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:21:08,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:21:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:21:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:21:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:21:08,998 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:21:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:21:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:21:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:21:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:21:08,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:21:09,084 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:21:09,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:21:09,431 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-01-09 15:21:09,432 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:21:09,444 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:21:09,445 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:21:09,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:21:09 BoogieIcfgContainer [2025-01-09 15:21:09,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:21:09,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:21:09,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:21:09,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:21:09,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:21:08" (1/3) ... [2025-01-09 15:21:09,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1113026a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:21:09, skipping insertion in model container [2025-01-09 15:21:09,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:08" (2/3) ... [2025-01-09 15:21:09,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1113026a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:21:09, skipping insertion in model container [2025-01-09 15:21:09,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:21:09" (3/3) ... [2025-01-09 15:21:09,454 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:09,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:21:09,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-35.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:21:09,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:21:09,518 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;@10f3217e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:21:09,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:21:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 80 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:21:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:09,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:09,534 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:09,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:09,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1906476390, now seen corresponding path program 1 times [2025-01-09 15:21:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:21:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749644200] [2025-01-09 15:21:09,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:21:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:09,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:09,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:09,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:21:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:21:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749644200] [2025-01-09 15:21:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749644200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:21:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637563160] [2025-01-09 15:21:09,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:21:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:21:09,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:21:09,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:21:09,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:09,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:09,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:09,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:21:09,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:21:09,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637563160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:09,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:21:09,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:21:09,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159742034] [2025-01-09 15:21:09,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:21:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:21:10,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:21:10,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:21:10,003 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 80 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:10,020 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2025-01-09 15:21:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:21:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-01-09 15:21:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:10,026 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:21:10,026 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:21:10,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:21:10,030 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:10,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:21:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:21:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:21:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:21:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-01-09 15:21:10,056 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2025-01-09 15:21:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:10,057 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-01-09 15:21:10,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-01-09 15:21:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:10,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:10,060 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:21:10,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:21:10,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -617863674, now seen corresponding path program 1 times [2025-01-09 15:21:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:21:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800639263] [2025-01-09 15:21:10,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:21:10,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:10,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:10,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:21:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:21:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800639263] [2025-01-09 15:21:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800639263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:21:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954322515] [2025-01-09 15:21:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:21:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:21:11,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:21:11,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:21:11,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:11,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:11,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:11,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:11,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:21:11,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:11,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:21:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2025-01-09 15:21:11,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2025-01-09 15:21:11,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:21:11,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2025-01-09 15:21:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 15:21:11,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:21:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:21:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954322515] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:21:12,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:21:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-01-09 15:21:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83652480] [2025-01-09 15:21:12,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:21:12,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:21:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:21:12,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:21:12,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:21:12,232 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 16 states, 13 states have (on average 5.615384615384615) internal successors, (73), 16 states have internal predecessors, (73), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 15:21:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:12,706 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2025-01-09 15:21:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 15:21:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.615384615384615) internal successors, (73), 16 states have internal predecessors, (73), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 5 states have call successors, (34) Word has length 143 [2025-01-09 15:21:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:12,708 INFO L225 Difference]: With dead ends: 301 [2025-01-09 15:21:12,708 INFO L226 Difference]: Without dead ends: 207 [2025-01-09 15:21:12,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 278 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:21:12,709 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 315 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:12,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 684 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:21:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-01-09 15:21:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 103. [2025-01-09 15:21:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:21:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2025-01-09 15:21:12,733 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 143 [2025-01-09 15:21:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:12,734 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2025-01-09 15:21:12,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.615384615384615) internal successors, (73), 16 states have internal predecessors, (73), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (34), 2 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 15:21:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2025-01-09 15:21:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:12,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:12,735 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:12,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:21:12,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:21:12,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:12,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1988159880, now seen corresponding path program 1 times [2025-01-09 15:21:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:21:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530280159] [2025-01-09 15:21:12,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:21:12,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:13,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:13,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:21:13,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:21:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:13,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:13,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:21:13,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:21:13,151 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:21:13,152 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:21:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:21:13,156 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 15:21:13,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:21:13,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:21:13 BoogieIcfgContainer [2025-01-09 15:21:13,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:21:13,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:21:13,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:21:13,245 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:21:13,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:21:09" (3/4) ... [2025-01-09 15:21:13,247 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:21:13,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:21:13,248 INFO L158 Benchmark]: Toolchain (without parser) took 4593.51ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.0MB in the beginning and 154.2MB in the end (delta: -44.2MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2025-01-09 15:21:13,248 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:21:13,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.66ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 95.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:21:13,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:21:13,249 INFO L158 Benchmark]: Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 86.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:21:13,249 INFO L158 Benchmark]: RCFGBuilder took 497.48ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 57.1MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:21:13,250 INFO L158 Benchmark]: TraceAbstraction took 3796.87ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 57.1MB in the beginning and 154.3MB in the end (delta: -97.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2025-01-09 15:21:13,250 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 285.2MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:21:13,251 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.66ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 95.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 91.7MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.43ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 86.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 497.48ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 57.1MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3796.87ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 57.1MB in the beginning and 154.3MB in the end (delta: -97.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 285.2MB. Free memory was 154.3MB in the beginning and 154.2MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L107] isInitial = 1 [L108] FCALL initially() [L110] CALL updateLastVariables() [L100] EXPR unsigned_char_Array_0[1] [L100] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_unsigned_char_Array_0_1_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-6, unsigned_char_Array_0={8:0}] [L42] COND TRUE last_1_unsigned_char_Array_0_1_ >= stepLocal_0 [L43] EXPR float_Array_0[1] [L43] EXPR float_Array_0[0] [L43] float_Array_0[2] = (float_Array_0[1] + float_Array_0[0]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[0] [L45] EXPR float_Array_0[1] [L45] unsigned char stepLocal_1 = (float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1]; [L46] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][1] && stepLocal_1 [L47] EXPR unsigned_char_Array_0[2] [L47] EXPR unsigned_char_Array_0[0] [L47] unsigned_char_Array_0[1] = (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)) [L51] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L54] EXPR BOOL_unsigned_char_Array_0[0][1] [L54] BOOL_unsigned_char_Array_0[1][1] = (! BOOL_unsigned_char_Array_0[0][1]) [L56] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L59] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L66] EXPR signed_char_Array_0[0][1] [L66] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 [L103] EXPR float_Array_0[2] [L103] EXPR float_Array_0[1] [L103] EXPR float_Array_0[0] [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103-L104] return (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 822 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 271 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 104 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 5 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2900/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:21:13,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.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 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:21:15,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:21:15,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:21:15,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:21:15,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:21:15,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:21:15,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:21:15,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:21:15,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:21:15,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:21:15,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:21:15,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:21:15,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:21:15,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:21:15,286 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:21:15,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:21:15,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:21:15,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:21:15,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:15,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:21:15,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:15,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:21:15,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:21:15,291 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 -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2025-01-09 15:21:15,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:21:15,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:21:15,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:21:15,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:21:15,571 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:21:15,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:16,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5320314/e21b1b21b8e64199aa542937c9b28a63/FLAG04423b096 [2025-01-09 15:21:16,905 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:21:16,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:16,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5320314/e21b1b21b8e64199aa542937c9b28a63/FLAG04423b096 [2025-01-09 15:21:17,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5320314/e21b1b21b8e64199aa542937c9b28a63 [2025-01-09 15:21:17,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:21:17,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:21:17,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:21:17,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:21:17,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:21:17,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678dea1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17, skipping insertion in model container [2025-01-09 15:21:17,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:21:17,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2025-01-09 15:21:17,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:21:17,444 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:21:17,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2025-01-09 15:21:17,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:21:17,494 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:21:17,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17 WrapperNode [2025-01-09 15:21:17,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:21:17,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:21:17,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:21:17,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:21:17,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,531 INFO L138 Inliner]: procedures = 33, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2025-01-09 15:21:17,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:21:17,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:21:17,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:21:17,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:21:17,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,557 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2025-01-09 15:21:17,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:21:17,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:21:17,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:21:17,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:21:17,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (1/1) ... [2025-01-09 15:21:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:21:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:21:17,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:21:17,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:21:17,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:21:17,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:21:17,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:21:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:21:17,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:21:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:21:17,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:21:17,751 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:21:17,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:21:18,501 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-01-09 15:21:18,501 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:21:18,516 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:21:18,516 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:21:18,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:21:18 BoogieIcfgContainer [2025-01-09 15:21:18,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:21:18,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:21:18,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:21:18,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:21:18,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:21:17" (1/3) ... [2025-01-09 15:21:18,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd59978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:21:18, skipping insertion in model container [2025-01-09 15:21:18,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:21:17" (2/3) ... [2025-01-09 15:21:18,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd59978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:21:18, skipping insertion in model container [2025-01-09 15:21:18,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:21:18" (3/3) ... [2025-01-09 15:21:18,523 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2025-01-09 15:21:18,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:21:18,535 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-35.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:21:18,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:21:18,584 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;@31c6dc80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:21:18,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:21:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 80 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:21:18,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:18,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:18,596 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:18,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:18,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1906476390, now seen corresponding path program 1 times [2025-01-09 15:21:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952301573] [2025-01-09 15:21:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:18,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:18,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:18,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:21:18,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:18,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:18,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:18,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:18,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:21:18,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-09 15:21:19,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:19,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952301573] [2025-01-09 15:21:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952301573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:21:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:21:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259106004] [2025-01-09 15:21:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:19,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:21:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:19,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:21:19,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:21:19,027 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 80 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:19,051 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2025-01-09 15:21:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:21:19,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-01-09 15:21:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:19,058 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:21:19,058 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:21:19,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:21:19,065 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:19,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:21:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:21:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:21:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:21:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-01-09 15:21:19,102 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2025-01-09 15:21:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:19,102 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-01-09 15:21:19,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-01-09 15:21:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:19,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:19,108 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:19,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:21:19,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:19,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -617863674, now seen corresponding path program 1 times [2025-01-09 15:21:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191067929] [2025-01-09 15:21:19,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:19,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:19,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:21:19,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:19,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:19,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:19,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:19,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:21:19,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:19,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:21:19,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-01-09 15:21:20,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2025-01-09 15:21:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:21:20,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2025-01-09 15:21:20,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 20 [2025-01-09 15:21:20,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:21:20,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2025-01-09 15:21:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 201 proven. 42 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-01-09 15:21:20,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:21:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:21:20,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191067929] [2025-01-09 15:21:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191067929] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:21:20,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:21:20,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-01-09 15:21:20,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704457877] [2025-01-09 15:21:20,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:21:20,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:21:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:20,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:21:20,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:21:20,808 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-01-09 15:21:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:22,310 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2025-01-09 15:21:22,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:21:22,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 143 [2025-01-09 15:21:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:22,312 INFO L225 Difference]: With dead ends: 307 [2025-01-09 15:21:22,312 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 15:21:22,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:21:22,314 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 196 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:22,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 760 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:21:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 15:21:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2025-01-09 15:21:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 153 states have internal predecessors, (198), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:21:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2025-01-09 15:21:22,335 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 270 transitions. Word has length 143 [2025-01-09 15:21:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:22,335 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 270 transitions. [2025-01-09 15:21:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2025-01-09 15:21:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 270 transitions. [2025-01-09 15:21:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:22,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:22,337 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:22,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:21:22,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:22,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1988159880, now seen corresponding path program 1 times [2025-01-09 15:21:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541435006] [2025-01-09 15:21:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:22,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:22,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:22,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:22,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:21:22,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:29,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:29,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:29,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:29,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 15:21:29,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:21:29,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-01-09 15:21:31,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:21:31,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 107 [2025-01-09 15:21:40,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:21:40,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 131 [2025-01-09 15:21:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-09 15:21:41,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:41,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541435006] [2025-01-09 15:21:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541435006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:21:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:21:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052265089] [2025-01-09 15:21:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:41,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:21:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:41,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:21:41,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:21:41,643 INFO L87 Difference]: Start difference. First operand 194 states and 270 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:21:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:50,369 INFO L93 Difference]: Finished difference Result 863 states and 1190 transitions. [2025-01-09 15:21:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:21:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2025-01-09 15:21:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:50,374 INFO L225 Difference]: With dead ends: 863 [2025-01-09 15:21:50,374 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 15:21:50,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:21:50,376 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 381 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:50,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1700 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-01-09 15:21:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 15:21:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-01-09 15:21:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 521 states have (on average 1.2975047984644914) internal successors, (676), 530 states have internal predecessors, (676), 118 states have call successors, (118), 20 states have call predecessors, (118), 20 states have return successors, (118), 109 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 15:21:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 912 transitions. [2025-01-09 15:21:50,445 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 912 transitions. Word has length 143 [2025-01-09 15:21:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 912 transitions. [2025-01-09 15:21:50,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:21:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 912 transitions. [2025-01-09 15:21:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:50,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:50,450 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:50,466 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-01-09 15:21:50,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:50,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:50,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 182721546, now seen corresponding path program 1 times [2025-01-09 15:21:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085534488] [2025-01-09 15:21:50,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:50,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:50,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:50,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:21:50,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:50,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:50,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:50,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:21:50,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:21:50,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:50,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085534488] [2025-01-09 15:21:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085534488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:21:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:21:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906824859] [2025-01-09 15:21:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:21:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:50,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:21:50,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:21:50,941 INFO L87 Difference]: Start difference. First operand 660 states and 912 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:21:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:51,106 INFO L93 Difference]: Finished difference Result 1207 states and 1669 transitions. [2025-01-09 15:21:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:21:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-01-09 15:21:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:51,117 INFO L225 Difference]: With dead ends: 1207 [2025-01-09 15:21:51,117 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 15:21:51,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01-09 15:21:51,119 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:51,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:21:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 15:21:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 525. [2025-01-09 15:21:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 413 states have (on average 1.2881355932203389) internal successors, (532), 419 states have internal predecessors, (532), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:21:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 722 transitions. [2025-01-09 15:21:51,176 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 722 transitions. Word has length 143 [2025-01-09 15:21:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:51,176 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 722 transitions. [2025-01-09 15:21:51,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:21:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 722 transitions. [2025-01-09 15:21:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:51,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:51,178 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:51,187 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-01-09 15:21:51,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:51,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1104650890, now seen corresponding path program 1 times [2025-01-09 15:21:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454530817] [2025-01-09 15:21:51,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:51,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:51,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:21:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:51,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:51,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:21:51,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:21:51,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:51,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454530817] [2025-01-09 15:21:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454530817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:51,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:21:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:21:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118066070] [2025-01-09 15:21:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:21:51,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:21:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:21:51,682 INFO L87 Difference]: Start difference. First operand 525 states and 722 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:51,736 INFO L93 Difference]: Finished difference Result 1051 states and 1447 transitions. [2025-01-09 15:21:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:21:51,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-01-09 15:21:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:51,739 INFO L225 Difference]: With dead ends: 1051 [2025-01-09 15:21:51,740 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 15:21:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:21:51,741 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:51,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:21:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 15:21:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-01-09 15:21:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.2805755395683454) internal successors, (534), 423 states have internal predecessors, (534), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:21:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 724 transitions. [2025-01-09 15:21:51,782 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 724 transitions. Word has length 143 [2025-01-09 15:21:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 724 transitions. [2025-01-09 15:21:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 724 transitions. [2025-01-09 15:21:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:21:51,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:51,785 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:51,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:21:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:51,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 121451206, now seen corresponding path program 1 times [2025-01-09 15:21:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405952064] [2025-01-09 15:21:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:51,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:51,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:21:52,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:21:52,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:21:52,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:52,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:52,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:21:52,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 15:21:52,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:21:52,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:21:52,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405952064] [2025-01-09 15:21:52,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405952064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:21:52,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:21:52,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:21:52,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778056767] [2025-01-09 15:21:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:21:52,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:21:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:21:52,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:21:52,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:21:52,299 INFO L87 Difference]: Start difference. First operand 529 states and 724 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:21:52,353 INFO L93 Difference]: Finished difference Result 1055 states and 1445 transitions. [2025-01-09 15:21:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:21:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-01-09 15:21:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:21:52,356 INFO L225 Difference]: With dead ends: 1055 [2025-01-09 15:21:52,356 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 15:21:52,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:21:52,358 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:21:52,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:21:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 15:21:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-01-09 15:21:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.275779376498801) internal successors, (532), 423 states have internal predecessors, (532), 95 states have call successors, (95), 16 states have call predecessors, (95), 16 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 15:21:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 722 transitions. [2025-01-09 15:21:52,405 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 722 transitions. Word has length 143 [2025-01-09 15:21:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:21:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 722 transitions. [2025-01-09 15:21:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:21:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 722 transitions. [2025-01-09 15:21:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:21:52,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:21:52,408 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:21:52,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:21:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:52,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:21:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:21:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -713743378, now seen corresponding path program 1 times [2025-01-09 15:21:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:21:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682261641] [2025-01-09 15:21:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:21:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:21:52,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:21:52,612 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:21:52,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:21:52,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:21:59,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:21:59,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:21:59,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:21:59,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 15:21:59,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:21:59,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:21:59,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-01-09 15:22:01,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:22:01,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 105 [2025-01-09 15:22:19,935 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)