./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:06:46,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:06:46,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:06:46,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:06:46,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:06:46,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:06:46,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:06:46,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:06:46,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:06:46,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:06:46,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:06:46,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:06:46,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:06:46,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:06:46,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:06:46,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:06:46,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:06:46,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:46,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:06:46,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:06:46,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:06:46,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:06:46,782 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/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 -> b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 [2025-03-04 01:06:46,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:06:47,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:06:47,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:06:47,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:06:47,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:06:47,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:06:48,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba116e66/59021271332a48e6b97be716bca7759c/FLAG672fb97bd [2025-03-04 01:06:48,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:06:48,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:06:48,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba116e66/59021271332a48e6b97be716bca7759c/FLAG672fb97bd [2025-03-04 01:06:48,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba116e66/59021271332a48e6b97be716bca7759c [2025-03-04 01:06:48,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:06:48,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:06:48,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:48,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:06:48,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:06:48,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:48,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3829d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48, skipping insertion in model container [2025-03-04 01:06:48,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:48,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:06:48,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i[916,929] [2025-03-04 01:06:48,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:48,932 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:06:48,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i[916,929] [2025-03-04 01:06:48,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:48,982 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:06:48,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48 WrapperNode [2025-03-04 01:06:48,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:48,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:48,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:06:48,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:06:48,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,031 INFO L138 Inliner]: procedures = 29, calls = 211, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 595 [2025-03-04 01:06:49,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:49,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:06:49,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:06:49,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:06:49,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,074 INFO L175 MemorySlicer]: Split 170 memory accesses to 5 slices as follows [2, 31, 40, 30, 67]. 39 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 4, 4, 4, 6]. The 23 writes are split as follows [0, 7, 4, 5, 7]. [2025-03-04 01:06:49,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:06:49,102 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:06:49,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:06:49,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:06:49,103 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (1/1) ... [2025-03-04 01:06:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:06:49,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:06:49,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:06:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:06:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:06:49,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:06:49,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:06:49,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:06:49,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:06:49,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:06:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:06:49,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:06:49,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:06:49,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:06:49,698 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-03-04 01:06:49,739 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-03-04 01:06:49,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:06:49,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:06:49,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:06:49,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:06:49 BoogieIcfgContainer [2025-03-04 01:06:49,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:06:49,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:06:49,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:06:49,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:06:49,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:06:48" (1/3) ... [2025-03-04 01:06:49,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cbdd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:06:49, skipping insertion in model container [2025-03-04 01:06:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:48" (2/3) ... [2025-03-04 01:06:49,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cbdd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:06:49, skipping insertion in model container [2025-03-04 01:06:49,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:06:49" (3/3) ... [2025-03-04 01:06:49,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:06:49,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:06:49,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-50.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:06:49,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:06:49,824 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;@4e417cae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:06:49,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:06:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:06:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:06:49,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:49,840 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:06:49,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:49,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash -517581095, now seen corresponding path program 1 times [2025-03-04 01:06:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678153154] [2025-03-04 01:06:49,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:49,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:06:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:06:49,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:49,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 01:06:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678153154] [2025-03-04 01:06:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678153154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:06:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962832127] [2025-03-04 01:06:50,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:50,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:06:50,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:06:50,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:06:50,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:06:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:06:50,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:06:50,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:50,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:50,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:06:50,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 01:06:50,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:50,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962832127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:50,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:06:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:06:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961944290] [2025-03-04 01:06:50,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:06:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:50,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:06:50,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:06:50,474 INFO L87 Difference]: Start difference. First operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:50,498 INFO L93 Difference]: Finished difference Result 252 states and 401 transitions. [2025-03-04 01:06:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:06:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-03-04 01:06:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:50,505 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:06:50,505 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 01:06:50,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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-03-04 01:06:50,510 INFO L435 NwaCegarLoop]: 185 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, 185 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-03-04 01:06:50,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:06:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 01:06:50,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 01:06:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:06:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2025-03-04 01:06:50,541 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2025-03-04 01:06:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:50,541 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2025-03-04 01:06:50,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2025-03-04 01:06:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:06:50,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:50,544 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:06:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:06:50,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:06:50,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -333113981, now seen corresponding path program 1 times [2025-03-04 01:06:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:50,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788596390] [2025-03-04 01:06:50,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:50,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:06:50,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:06:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 01:06:51,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788596390] [2025-03-04 01:06:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788596390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:51,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:06:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217792099] [2025-03-04 01:06:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:51,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:06:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:51,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:06:51,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:06:51,220 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:51,392 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2025-03-04 01:06:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:06:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-03-04 01:06:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:51,397 INFO L225 Difference]: With dead ends: 403 [2025-03-04 01:06:51,397 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:06:51,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:06:51,400 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 189 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:51,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 919 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:06:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:06:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2025-03-04 01:06:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 207 states have internal predecessors, (284), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:06:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2025-03-04 01:06:51,441 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 195 [2025-03-04 01:06:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:51,442 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2025-03-04 01:06:51,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2025-03-04 01:06:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:06:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:51,446 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:06:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:06:51,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:51,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash -205927417, now seen corresponding path program 1 times [2025-03-04 01:06:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935669146] [2025-03-04 01:06:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:51,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:51,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:06:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:06:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 01:06:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935669146] [2025-03-04 01:06:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935669146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:06:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900841679] [2025-03-04 01:06:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:06:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:52,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:06:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:06:52,790 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:52,960 INFO L93 Difference]: Finished difference Result 621 states and 911 transitions. [2025-03-04 01:06:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:06:52,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-03-04 01:06:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:52,964 INFO L225 Difference]: With dead ends: 621 [2025-03-04 01:06:52,964 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 01:06:52,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:52,968 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 55 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:52,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 950 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:06:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 01:06:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2025-03-04 01:06:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 293 states have (on average 1.3651877133105803) internal successors, (400), 295 states have internal predecessors, (400), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:06:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 520 transitions. [2025-03-04 01:06:53,006 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 520 transitions. Word has length 195 [2025-03-04 01:06:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 520 transitions. [2025-03-04 01:06:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:06:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 520 transitions. [2025-03-04 01:06:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:06:53,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:53,010 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:06:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:06:53,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -525102695, now seen corresponding path program 1 times [2025-03-04 01:06:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756464145] [2025-03-04 01:06:53,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:53,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:06:53,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:06:53,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:53,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:06:53,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:06:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:06:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:06:53,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:53,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:06:53,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:06:53,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:06:53,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:06:53,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:06:53,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 01:06:53,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:06:53,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:06:53 BoogieIcfgContainer [2025-03-04 01:06:53,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:06:53,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:06:53,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:06:53,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:06:53,391 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:06:49" (3/4) ... [2025-03-04 01:06:53,393 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:06:53,394 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:06:53,394 INFO L158 Benchmark]: Toolchain (without parser) took 4674.08ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 113.5MB in the beginning and 77.8MB in the end (delta: 35.7MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2025-03-04 01:06:53,395 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:53,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.74ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 96.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:06:53,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.86ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:53,396 INFO L158 Benchmark]: Boogie Preprocessor took 70.28ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:06:53,396 INFO L158 Benchmark]: IcfgBuilder took 646.66ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 52.2MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:06:53,397 INFO L158 Benchmark]: TraceAbstraction took 3639.43ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 51.8MB in the beginning and 77.9MB in the end (delta: -26.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-03-04 01:06:53,397 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 192.9MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:53,398 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.74ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 96.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.86ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.28ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 88.0MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 646.66ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 52.2MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3639.43ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 51.8MB in the beginning and 77.9MB in the end (delta: -26.1MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 192.9MB. Free memory was 77.9MB in the beginning and 77.8MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 1} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L25-L27] double double_Array_0[2][2] = { {127.8, 63.5}, {16.6, 8.875} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {0, -5}, {128, 100} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L31-L33] signed short int signed_short_int_Array_0[2][3] = { {-2, 26204, 2}, {64, 5, 4} }; [L34] signed long int last_1_signed_long_int_Array_0_0__1_ = -5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] EXPR signed_long_int_Array_0[0][1] [L112] last_1_signed_long_int_Array_0_0__1_ = signed_long_int_Array_0[0][1] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] double_Array_0[0][0] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F [L79] EXPR double_Array_0[0][0] [L79] EXPR double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR (double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not((double_Array_0[0][0] >= 0.0F && double_Array_0[0][0] <= -1.0e-20F) || (double_Array_0[0][0] <= 9223372.036854776000e+12F && double_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] double_Array_0[1][0] = __VERIFIER_nondet_double() [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F [L81] EXPR double_Array_0[1][0] [L81] EXPR double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR (double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not((double_Array_0[1][0] >= 0.0F && double_Array_0[1][0] <= -1.0e-20F) || (double_Array_0[1][0] <= 9223372.036854776000e+12F && double_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] double_Array_0[0][1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F [L83] EXPR double_Array_0[0][1] [L83] EXPR double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] EXPR (double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not((double_Array_0[0][1] >= -922337.2036854776000e+13F && double_Array_0[0][1] <= -1.0e-20F) || (double_Array_0[0][1] <= 9223372.036854776000e+12F && double_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] double_Array_0[1][1] = __VERIFIER_nondet_double() [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F [L85] EXPR double_Array_0[1][1] [L85] EXPR double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] EXPR (double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not((double_Array_0[1][1] >= -922337.2036854776000e+13F && double_Array_0[1][1] <= -1.0e-20F) || (double_Array_0[1][1] <= 9223372.036854776000e+12F && double_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L87] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] EXPR signed_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] signed_long_int_Array_0[1][0] = __VERIFIER_nondet_long() [L90] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_long_int_Array_0[1][0] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_long_int_Array_0[1][1] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[1][1] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] signed_short_int_Array_0[1][0] = __VERIFIER_nondet_short() [L96] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1][0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] EXPR signed_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[1][0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L98] signed_short_int_Array_0[0][1] = __VERIFIER_nondet_short() [L99] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L99] RET assume_abort_if_not(signed_short_int_Array_0[0][1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] EXPR signed_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[0][1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] signed_short_int_Array_0[1][1] = __VERIFIER_nondet_short() [L102] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L102] RET assume_abort_if_not(signed_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] CALL assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L103] RET assume_abort_if_not(signed_short_int_Array_0[1][1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L104] signed_short_int_Array_0[0][2] = __VERIFIER_nondet_short() [L105] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] RET assume_abort_if_not(signed_short_int_Array_0[0][2] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] EXPR signed_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] CALL assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L106] RET assume_abort_if_not(signed_short_int_Array_0[0][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L107] signed_short_int_Array_0[1][2] = __VERIFIER_nondet_short() [L108] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L108] RET assume_abort_if_not(signed_short_int_Array_0[1][2] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] EXPR signed_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] CALL assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET assume_abort_if_not(signed_short_int_Array_0[1][2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L123] RET updateVariables() [L124] CALL step() [L38] signed long int stepLocal_1 = last_1_signed_long_int_Array_0_0__1_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=-5] [L39] COND FALSE !(stepLocal_1 >= 0) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR signed_short_int_Array_0[1][2] [L42] EXPR signed_short_int_Array_0[0][1] [L42] EXPR signed_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) [L42] EXPR signed_short_int_Array_0[1][0] [L42] EXPR ((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L42] signed_short_int_Array_0[0][0] = ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))) [L44] EXPR signed_short_int_Array_0[1][2] [L44] EXPR signed_long_int_Array_0[1][1] [L44] signed long int stepLocal_3 = signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1]; [L45] EXPR signed_short_int_Array_0[0][0] [L45] signed short int stepLocal_2 = signed_short_int_Array_0[0][0]; [L46] EXPR signed_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND FALSE !(signed_short_int_Array_0[0][0] > stepLocal_3) [L51] EXPR signed_short_int_Array_0[0][2] [L51] signed_long_int_Array_0[0][1] = signed_short_int_Array_0[0][2] [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) [L53] EXPR signed_short_int_Array_0[0][0] [L53] EXPR ((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-6] [L53] signed long int stepLocal_0 = (((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1])); [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR double_Array_0[1][0] [L54] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L54] EXPR double_Array_0[1][1] [L54] EXPR double_Array_0[0][1] [L54] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-6, stepLocal_2=-6] [L54] COND TRUE (((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9 [L55] EXPR signed_long_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L55] COND FALSE !(stepLocal_0 < signed_long_int_Array_0[0][1]) [L62] EXPR BOOL_unsigned_char_Array_0[1][0] [L62] BOOL_unsigned_char_Array_0[1][1] = BOOL_unsigned_char_Array_0[1][0] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR double_Array_0[1][0] [L115] EXPR double_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) [L115] EXPR double_Array_0[1][1] [L115] EXPR double_Array_0[0][1] [L115] EXPR (((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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])) [L115] EXPR BOOL_unsigned_char_Array_0[1][1] [L115] EXPR BOOL_unsigned_char_Array_0[0][1] [L115] EXPR ((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR (((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115] EXPR ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L115-L116] return ((((((((double_Array_0[1][1] + double_Array_0[0][1])) < ((double_Array_0[1][0] - double_Array_0[0][0]))) ? ((double_Array_0[1][1] + double_Array_0[0][1])) : ((double_Array_0[1][0] - double_Array_0[0][0])))) != 31.9) ? ((((((signed_short_int_Array_0[0][0]) > (signed_long_int_Array_0[0][1])) ? (signed_short_int_Array_0[0][0]) : (signed_long_int_Array_0[0][1]))) < signed_long_int_Array_0[0][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[1][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]))) && ((last_1_signed_long_int_Array_0_0__1_ >= 0) ? (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > (signed_short_int_Array_0[0][2])) ? (signed_short_int_Array_0[1][0]) : (signed_short_int_Array_0[0][2]))))) : (signed_short_int_Array_0[0][0] == ((signed short int) ((((signed_short_int_Array_0[1][0]) > ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1])))) ? (signed_short_int_Array_0[1][0]) : ((signed_short_int_Array_0[1][2] - (signed_short_int_Array_0[0][1] - signed_short_int_Array_0[1][1]))))))))) && ((signed_short_int_Array_0[0][0] > (signed_short_int_Array_0[1][2] - signed_long_int_Array_0[1][1])) ? ((signed_short_int_Array_0[1][0] < signed_short_int_Array_0[0][0]) ? (signed_long_int_Array_0[0][1] == ((signed long int) ((signed_short_int_Array_0[1][1] + (signed_short_int_Array_0[0][1] + signed_long_int_Array_0[0][0])) - signed_long_int_Array_0[1][0]))) : 1) : (signed_long_int_Array_0[0][1] == ((signed long int) signed_short_int_Array_0[0][2]))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0__1_=-5, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 2054 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 602 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 1763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 646 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5150/5200 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-03-04 01:06:53,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:06:55,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:06:55,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:06:55,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:06:55,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:06:55,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:06:55,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:06:55,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:06:55,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:06:55,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:06:55,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:06:55,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:06:55,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:06:55,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:06:55,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:06:55,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:06:55,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:06:55,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:06:55,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:06:55,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:55,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:06:55,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:06:55,448 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/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 -> b2c43a938751bae85f17b1d558ada7f636ee625ce48934ddcde2b352d5a92c51 [2025-03-04 01:06:55,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:06:55,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:06:55,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:06:55,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:06:55,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:06:55,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:06:56,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f9e77b1/bf40a9362c2f4e34b7077b2620c8ceea/FLAG7b4c0baca [2025-03-04 01:06:57,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:06:57,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:06:57,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f9e77b1/bf40a9362c2f4e34b7077b2620c8ceea/FLAG7b4c0baca [2025-03-04 01:06:57,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f9e77b1/bf40a9362c2f4e34b7077b2620c8ceea [2025-03-04 01:06:57,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:06:57,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:06:57,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:57,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:06:57,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:06:57,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab4b8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57, skipping insertion in model container [2025-03-04 01:06:57,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:06:57,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i[916,929] [2025-03-04 01:06:57,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:57,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:06:57,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-50.i[916,929] [2025-03-04 01:06:57,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:57,767 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:06:57,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57 WrapperNode [2025-03-04 01:06:57,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:57,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:57,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:06:57,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:06:57,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,840 INFO L138 Inliner]: procedures = 36, calls = 211, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2025-03-04 01:06:57,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:57,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:06:57,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:06:57,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:06:57,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,882 INFO L175 MemorySlicer]: Split 170 memory accesses to 5 slices as follows [2, 31, 40, 30, 67]. 39 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 4, 4, 4, 6]. The 23 writes are split as follows [0, 7, 4, 5, 7]. [2025-03-04 01:06:57,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:06:57,915 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:06:57,915 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:06:57,915 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:06:57,916 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (1/1) ... [2025-03-04 01:06:57,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:06:57,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:06:57,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:06:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:06:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:06:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:06:57,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:06:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:06:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:06:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:06:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:06:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:06:58,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:06:58,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:07:03,281 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite140#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem129#1;havoc property_#t~ite134#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~ite157#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem156#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~ite155#1;havoc property_#t~mem151#1;havoc property_#t~mem154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short158#1;havoc property_#t~mem161#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite172#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite169#1;havoc property_#t~mem168#1;havoc property_#t~mem166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~mem171#1;havoc property_#t~mem170#1;havoc property_#t~short173#1; [2025-03-04 01:07:03,313 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2025-03-04 01:07:03,313 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:07:03,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:07:03,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:07:03,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:07:03 BoogieIcfgContainer [2025-03-04 01:07:03,325 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:07:03,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:07:03,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:07:03,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:07:03,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:06:57" (1/3) ... [2025-03-04 01:07:03,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31268c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:07:03, skipping insertion in model container [2025-03-04 01:07:03,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:57" (2/3) ... [2025-03-04 01:07:03,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31268c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:07:03, skipping insertion in model container [2025-03-04 01:07:03,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:07:03" (3/3) ... [2025-03-04 01:07:03,333 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-50.i [2025-03-04 01:07:03,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:07:03,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-50.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:07:03,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:07:03,384 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;@4711563f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:07:03,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:07:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:07:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:07:03,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:03,397 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:03,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:03,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -517581095, now seen corresponding path program 1 times [2025-03-04 01:07:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539023604] [2025-03-04 01:07:03,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:03,408 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-03-04 01:07:03,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:03,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 01:07:03,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:07:04,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:07:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:04,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:07:04,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-04 01:07:04,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:04,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539023604] [2025-03-04 01:07:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539023604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:04,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:07:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316497159] [2025-03-04 01:07:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:07:04,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:04,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:07:04,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:07:04,115 INFO L87 Difference]: Start difference. First operand has 129 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:04,137 INFO L93 Difference]: Finished difference Result 252 states and 401 transitions. [2025-03-04 01:07:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:07:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-03-04 01:07:04,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:04,143 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:07:04,144 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 01:07:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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-03-04 01:07:04,147 INFO L435 NwaCegarLoop]: 185 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, 185 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-03-04 01:07:04,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:07:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 01:07:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 01:07:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:07:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2025-03-04 01:07:04,189 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2025-03-04 01:07:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:04,189 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2025-03-04 01:07:04,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2025-03-04 01:07:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:07:04,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:04,192 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:04,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:04,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 01:07:04,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -333113981, now seen corresponding path program 1 times [2025-03-04 01:07:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075474094] [2025-03-04 01:07:04,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:04,395 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-03-04 01:07:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:04,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 01:07:04,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:04,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:07:04,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:07:04,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:04,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:05,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:07:05,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 01:07:05,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:05,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075474094] [2025-03-04 01:07:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075474094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:07:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711853395] [2025-03-04 01:07:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:05,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:05,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:05,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:07:05,882 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 01:07:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:06,304 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2025-03-04 01:07:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 195 [2025-03-04 01:07:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:06,309 INFO L225 Difference]: With dead ends: 403 [2025-03-04 01:07:06,309 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:07:06,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:07:06,313 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 198 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:06,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 759 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:07:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:07:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2025-03-04 01:07:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 207 states have internal predecessors, (284), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:07:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2025-03-04 01:07:06,348 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 195 [2025-03-04 01:07:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2025-03-04 01:07:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 01:07:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2025-03-04 01:07:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 01:07:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:06,354 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:06,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 01:07:06,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:06,556 INFO L85 PathProgramCache]: Analyzing trace with hash -205927417, now seen corresponding path program 1 times [2025-03-04 01:07:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777841766] [2025-03-04 01:07:06,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:06,557 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-03-04 01:07:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:06,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 01:07:06,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 01:07:07,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 01:07:07,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:07,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:07,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:07:07,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:07,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:07:07,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-04 01:07:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-04 01:07:07,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:07,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777841766] [2025-03-04 01:07:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777841766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:07:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792235494] [2025-03-04 01:07:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:07:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:07,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:07:07,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:07:07,400 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:12,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:14,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:16,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:16,565 INFO L93 Difference]: Finished difference Result 523 states and 775 transitions. [2025-03-04 01:07:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:07:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2025-03-04 01:07:16,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:16,570 INFO L225 Difference]: With dead ends: 523 [2025-03-04 01:07:16,570 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:07:16,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:07:16,573 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 159 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:16,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 570 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2025-03-04 01:07:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:07:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-04 01:07:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 207 states have internal predecessors, (282), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:07:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 386 transitions. [2025-03-04 01:07:16,597 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 386 transitions. Word has length 195 [2025-03-04 01:07:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 386 transitions. [2025-03-04 01:07:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2025-03-04 01:07:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 01:07:16,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:16,601 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:16,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 01:07:16,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1360183510, now seen corresponding path program 1 times [2025-03-04 01:07:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242213446] [2025-03-04 01:07:16,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:16,804 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-03-04 01:07:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:16,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-04 01:07:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:16,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 01:07:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 01:07:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:17,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:07:17,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2025-03-04 01:07:17,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:17,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242213446] [2025-03-04 01:07:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242213446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:17,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:17,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:07:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38573265] [2025-03-04 01:07:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:07:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:07:17,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:07:17,417 INFO L87 Difference]: Start difference. First operand 262 states and 386 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 01:07:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:17,813 INFO L93 Difference]: Finished difference Result 529 states and 779 transitions. [2025-03-04 01:07:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:07:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 197 [2025-03-04 01:07:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:17,815 INFO L225 Difference]: With dead ends: 529 [2025-03-04 01:07:17,815 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 01:07:17,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:07:17,817 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 711 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:07:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 01:07:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 262. [2025-03-04 01:07:17,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:07:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 384 transitions. [2025-03-04 01:07:17,836 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 384 transitions. Word has length 197 [2025-03-04 01:07:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:17,836 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 384 transitions. [2025-03-04 01:07:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2025-03-04 01:07:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 384 transitions. [2025-03-04 01:07:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 01:07:17,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:17,839 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:17,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:18,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-04 01:07:18,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -657587671, now seen corresponding path program 1 times [2025-03-04 01:07:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575227011] [2025-03-04 01:07:18,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:18,041 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-03-04 01:07:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:18,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-04 01:07:18,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-04 01:07:18,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 01:07:18,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:18,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:18,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:07:18,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:18,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:07:18,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:07:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-04 01:07:18,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:07:18,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575227011] [2025-03-04 01:07:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575227011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:07:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:07:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:07:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961532476] [2025-03-04 01:07:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:07:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:18,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:07:18,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:07:18,874 INFO L87 Difference]: Start difference. First operand 262 states and 384 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:22,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:23,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:25,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:26,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:07:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:27,037 INFO L93 Difference]: Finished difference Result 523 states and 767 transitions. [2025-03-04 01:07:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:07:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 197 [2025-03-04 01:07:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:27,043 INFO L225 Difference]: With dead ends: 523 [2025-03-04 01:07:27,043 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:07:27,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:07:27,046 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 148 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 562 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-04 01:07:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:07:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-04 01:07:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 207 states have internal predecessors, (278), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:07:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 382 transitions. [2025-03-04 01:07:27,074 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 382 transitions. Word has length 197 [2025-03-04 01:07:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 382 transitions. [2025-03-04 01:07:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:07:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 382 transitions. [2025-03-04 01:07:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-04 01:07:27,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:27,076 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:27,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:07:27,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-04 01:07:27,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:27,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1590831751, now seen corresponding path program 1 times [2025-03-04 01:07:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047519266] [2025-03-04 01:07:27,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:27,278 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-03-04 01:07:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:27,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-04 01:07:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:27,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-04 01:07:28,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-04 01:07:28,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:28,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:28,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:07:28,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:28,333 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-03-04 01:07:29,091 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 33 treesize of output 26 [2025-03-04 01:07:29,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:07:29,180 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 77 treesize of output 35 [2025-03-04 01:07:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-04 01:07:29,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:07:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 01:07:29,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:07:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047519266] [2025-03-04 01:07:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047519266] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:07:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:07:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2025-03-04 01:07:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669575044] [2025-03-04 01:07:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:07:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:07:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:07:29,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:07:29,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:07:29,640 INFO L87 Difference]: Start difference. First operand 262 states and 382 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 01:07:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:07:29,978 INFO L93 Difference]: Finished difference Result 621 states and 899 transitions. [2025-03-04 01:07:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:07:29,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2025-03-04 01:07:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:07:29,981 INFO L225 Difference]: With dead ends: 621 [2025-03-04 01:07:29,983 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 01:07:29,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:07:29,985 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 55 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:07:29,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 758 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:07:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 01:07:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2025-03-04 01:07:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 293 states have (on average 1.3447098976109215) internal successors, (394), 295 states have internal predecessors, (394), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 01:07:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 514 transitions. [2025-03-04 01:07:30,022 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 514 transitions. Word has length 199 [2025-03-04 01:07:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:07:30,022 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 514 transitions. [2025-03-04 01:07:30,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-04 01:07:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 514 transitions. [2025-03-04 01:07:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:07:30,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:07:30,024 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-04 01:07:30,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:30,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-04 01:07:30,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:07:30,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:07:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash -660143335, now seen corresponding path program 1 times [2025-03-04 01:07:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:07:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433661412] [2025-03-04 01:07:30,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:07:30,226 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-03-04 01:07:30,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:07:30,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-04 01:07:30,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:07:30,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:07:36,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:07:36,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:07:36,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:07:36,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:07:36,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:07:49,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:07:49,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 104 [2025-03-04 01:08:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-04 01:08:01,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:08:01,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:08:01,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433661412] [2025-03-04 01:08:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433661412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:08:01,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:08:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:08:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533745625] [2025-03-04 01:08:01,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:08:01,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:08:01,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:08:01,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:08:01,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:08:01,940 INFO L87 Difference]: Start difference. First operand 358 states and 514 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 9 states have internal predecessors, (76), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 01:08:03,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:05,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:07,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:09,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:11,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:12,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:14,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:17,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:18,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:19,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:22,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:23,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:24,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:26,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:08:27,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]