./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-42.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-ap_file-42.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 6b42afb425befffe59b79424852c909b3e1036728d2e8fd866af9c27ec055fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:17:04,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:17:04,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:17:04,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:17:04,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:17:04,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:17:04,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:17:04,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:17:04,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:17:04,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:17:04,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:17:04,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:17:04,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:17:04,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:17:04,965 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:17:04,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:17:04,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:17:04,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:17:04,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:17:04,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:17:04,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:04,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:17:04,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:17:04,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:17:04,968 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 -> 6b42afb425befffe59b79424852c909b3e1036728d2e8fd866af9c27ec055fcd [2025-03-04 01:17:05,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:17:05,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:17:05,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:17:05,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:17:05,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:17:05,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:06,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed87f3114/27847fdb9a674e4b8ef52e5a1260a85a/FLAG4b4475488 [2025-03-04 01:17:06,589 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:17:06,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:06,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed87f3114/27847fdb9a674e4b8ef52e5a1260a85a/FLAG4b4475488 [2025-03-04 01:17:06,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed87f3114/27847fdb9a674e4b8ef52e5a1260a85a [2025-03-04 01:17:06,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:17:06,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:17:06,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:06,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:17:06,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:17:06,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06, skipping insertion in model container [2025-03-04 01:17:06,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:17:06,731 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-ap_file-42.i[917,930] [2025-03-04 01:17:06,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:06,799 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:17:06,808 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-ap_file-42.i[917,930] [2025-03-04 01:17:06,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:06,854 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:17:06,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06 WrapperNode [2025-03-04 01:17:06,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:06,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:06,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:17:06,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:17:06,860 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:17:06" (1/1) ... [2025-03-04 01:17:06,867 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:17:06" (1/1) ... [2025-03-04 01:17:06,906 INFO L138 Inliner]: procedures = 29, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-03-04 01:17:06,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:06,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:17:06,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:17:06,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:17:06,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,949 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-03-04 01:17:06,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:17:06,979 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:17:06,979 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:17:06,979 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:17:06,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (1/1) ... [2025-03-04 01:17:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:06,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:07,007 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:17:07,009 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:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:17:07,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:17:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:17:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:17:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:17:07,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:17:07,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:17:07,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:17:07,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:17:07,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-04 01:17:07,490 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-04 01:17:07,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:17:07,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:17:07,501 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:17:07,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:07 BoogieIcfgContainer [2025-03-04 01:17:07,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:17:07,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:17:07,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:17:07,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:17:07,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:17:06" (1/3) ... [2025-03-04 01:17:07,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34221bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:07, skipping insertion in model container [2025-03-04 01:17:07,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:06" (2/3) ... [2025-03-04 01:17:07,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34221bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:07, skipping insertion in model container [2025-03-04 01:17:07,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:07" (3/3) ... [2025-03-04 01:17:07,510 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:07,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:17:07,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:17:07,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:17:07,579 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;@4f5c77fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:17:07,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:17:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:07,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:07,590 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:07,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:07,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1254385902, now seen corresponding path program 1 times [2025-03-04 01:17:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:07,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-04 01:17:07,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:07,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:07,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:07,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:07,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:17:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-03-04 01:17:07,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249493946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:07,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200605007] [2025-03-04 01:17:07,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:07,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:17:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:07,835 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:17:07,837 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:17:07,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:07,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:07,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:07,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:08,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:17:08,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:17:08,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200605007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:17:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247581079] [2025-03-04 01:17:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:08,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:17:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:08,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:17:08,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:17:08,048 INFO L87 Difference]: Start difference. First operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:08,067 INFO L93 Difference]: Finished difference Result 192 states and 290 transitions. [2025-03-04 01:17:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:17:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-04 01:17:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:08,073 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:17:08,073 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:17:08,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:17:08,076 INFO L435 NwaCegarLoop]: 135 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, 135 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:17:08,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:17:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:17:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-03-04 01:17:08,102 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2025-03-04 01:17:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:08,103 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-03-04 01:17:08,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-03-04 01:17:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:08,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:08,106 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:08,112 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:17:08,306 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:17:08,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1303725911, now seen corresponding path program 1 times [2025-03-04 01:17:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-04 01:17:08,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:08,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:08,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:08,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-04 01:17:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627024044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597207314] [2025-03-04 01:17:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:08,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:08,611 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:08,639 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2025-03-04 01:17:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-04 01:17:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:08,641 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:17:08,642 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:08,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:08,643 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:08,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-03-04 01:17:08,655 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2025-03-04 01:17:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-03-04 01:17:08,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-03-04 01:17:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:08,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:08,658 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:08,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:17:08,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1063185782, now seen corresponding path program 1 times [2025-03-04 01:17:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-04 01:17:08,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:08,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:08,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-04 01:17:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774728862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:08,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:08,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335715328] [2025-03-04 01:17:08,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:08,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:08,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:08,978 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:09,032 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2025-03-04 01:17:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:09,034 INFO L225 Difference]: With dead ends: 193 [2025-03-04 01:17:09,035 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:09,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:09,035 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:09,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-04 01:17:09,043 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 103 [2025-03-04 01:17:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:09,043 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-04 01:17:09,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-04 01:17:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:09,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:09,044 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:09,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:17:09,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:09,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1154572171, now seen corresponding path program 1 times [2025-03-04 01:17:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:09,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-04 01:17:09,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:09,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:09,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-04 01:17:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224672483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231967433] [2025-03-04 01:17:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:09,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:09,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:09,313 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:09,363 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2025-03-04 01:17:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:09,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:09,366 INFO L225 Difference]: With dead ends: 193 [2025-03-04 01:17:09,366 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:09,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:09,369 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:09,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-04 01:17:09,378 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 103 [2025-03-04 01:17:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:09,378 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-04 01:17:09,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-04 01:17:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:09,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:09,379 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:09,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:17:09,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:09,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 649013546, now seen corresponding path program 1 times [2025-03-04 01:17:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034920151] [2025-03-04 01:17:09,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:09,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:09,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:09,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:09,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034920151] [2025-03-04 01:17:09,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034920151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:09,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:09,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:17:09,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385005856] [2025-03-04 01:17:09,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:09,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:17:09,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:09,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:17:09,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:09,575 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:09,587 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2025-03-04 01:17:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:17:09,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:09,589 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:17:09,589 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:17:09,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:09,591 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:09,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:17:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:17:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2025-03-04 01:17:09,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 103 [2025-03-04 01:17:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2025-03-04 01:17:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2025-03-04 01:17:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:09,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:09,601 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:09,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:17:09,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1431594971, now seen corresponding path program 1 times [2025-03-04 01:17:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:09,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448292803] [2025-03-04 01:17:09,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:09,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:09,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448292803] [2025-03-04 01:17:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448292803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:09,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:09,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961633316] [2025-03-04 01:17:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:09,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:09,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:09,898 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:09,928 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2025-03-04 01:17:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:09,929 INFO L225 Difference]: With dead ends: 187 [2025-03-04 01:17:09,929 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:17:09,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:09,930 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:09,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:17:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:17:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-04 01:17:09,935 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103 [2025-03-04 01:17:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:09,935 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-04 01:17:09,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-03-04 01:17:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:09,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:09,936 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:09,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:17:09,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:09,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1908324362, now seen corresponding path program 1 times [2025-03-04 01:17:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-03-04 01:17:09,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:09,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:09,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:09,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-03-04 01:17:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282342602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758491922] [2025-03-04 01:17:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:10,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:10,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:10,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:10,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:10,262 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:10,292 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions. [2025-03-04 01:17:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:10,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:10,293 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:17:10,293 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:17:10,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:10,294 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:10,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:17:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:17:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2025-03-04 01:17:10,298 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 103 [2025-03-04 01:17:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:10,298 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2025-03-04 01:17:10,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2025-03-04 01:17:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:10,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:10,299 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:17:10,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:10,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -168884981, now seen corresponding path program 1 times [2025-03-04 01:17:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:10,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971896548] [2025-03-04 01:17:10,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:10,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:10,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:10,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:10,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971896548] [2025-03-04 01:17:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971896548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:10,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630499955] [2025-03-04 01:17:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:10,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:10,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:10,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:10,611 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:10,648 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2025-03-04 01:17:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:10,650 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:17:10,650 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 01:17:10,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:10,651 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:10,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 01:17:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-04 01:17:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2025-03-04 01:17:10,657 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 103 [2025-03-04 01:17:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:10,658 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2025-03-04 01:17:10,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2025-03-04 01:17:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:10,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:10,658 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:17:10,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:10,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash -674443606, now seen corresponding path program 1 times [2025-03-04 01:17:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:10,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444977336] [2025-03-04 01:17:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:10,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:11,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444977336] [2025-03-04 01:17:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444977336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:11,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:11,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:17:11,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284698897] [2025-03-04 01:17:11,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:11,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:17:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:11,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:17:11,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:17:11,325 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:17:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:11,621 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2025-03-04 01:17:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:17:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-03-04 01:17:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:11,623 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:17:11,623 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:17:11,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:17:11,623 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 270 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:11,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 633 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:17:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-04 01:17:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 104 states have internal predecessors, (130), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:17:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2025-03-04 01:17:11,635 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 170 transitions. Word has length 103 [2025-03-04 01:17:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:11,635 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 170 transitions. [2025-03-04 01:17:11,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:17:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 170 transitions. [2025-03-04 01:17:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:11,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:11,636 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:11,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:17:11,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1823572331, now seen corresponding path program 1 times [2025-03-04 01:17:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:11,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346647535] [2025-03-04 01:17:11,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:11,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:11,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:11,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:11,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:17:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346647535] [2025-03-04 01:17:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346647535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748797651] [2025-03-04 01:17:12,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:17:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:12,375 INFO L229 MonitoredProcess]: Starting monitored process 3 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:17:12,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:17:12,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:12,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:12,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:12,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:12,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:17:12,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:12,582 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 01:17:12,583 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 1 case distinctions, treesize of input 19 treesize of output 27 [2025-03-04 01:17:12,638 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 11 treesize of output 7 [2025-03-04 01:17:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:12,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748797651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-04 01:17:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442910441] [2025-03-04 01:17:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:12,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:12,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:17:12,781 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:12,964 INFO L93 Difference]: Finished difference Result 222 states and 297 transitions. [2025-03-04 01:17:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:17:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:12,965 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:17:12,965 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:17:12,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:17:12,966 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 100 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:12,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 825 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:17:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:17:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:17:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 102 states have internal predecessors, (126), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:17:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2025-03-04 01:17:12,978 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 103 [2025-03-04 01:17:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:12,978 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2025-03-04 01:17:12,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2025-03-04 01:17:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:17:12,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:12,978 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:13,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:17:13,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:13,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1353584920, now seen corresponding path program 1 times [2025-03-04 01:17:13,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:13,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302052861] [2025-03-04 01:17:13,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:13,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:17:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:17:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302052861] [2025-03-04 01:17:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302052861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998768034] [2025-03-04 01:17:13,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:13,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:17:13,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:13,874 INFO L229 MonitoredProcess]: Starting monitored process 4 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:17:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:17:13,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:14,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:14,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:14,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:17:14,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:14,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:17:14,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:17:14,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:17:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:17:15,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:17:15,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-04 01:17:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 132 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 01:17:15,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998768034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:15,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-03-04 01:17:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255145541] [2025-03-04 01:17:15,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:15,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:17:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:17:15,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:17:15,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:17:15,323 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 01:17:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:15,651 INFO L93 Difference]: Finished difference Result 235 states and 305 transitions. [2025-03-04 01:17:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:17:15,652 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 105 [2025-03-04 01:17:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:15,654 INFO L225 Difference]: With dead ends: 235 [2025-03-04 01:17:15,654 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:17:15,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:17:15,655 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 142 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:15,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 558 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:17:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-03-04 01:17:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 108 states have internal predecessors, (131), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:17:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2025-03-04 01:17:15,669 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 105 [2025-03-04 01:17:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:15,669 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2025-03-04 01:17:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2025-03-04 01:17:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2025-03-04 01:17:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:17:15,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:15,671 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:15,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:15,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:17:15,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1589438061, now seen corresponding path program 1 times [2025-03-04 01:17:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:17:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908235845] [2025-03-04 01:17:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:17:15,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:15,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:15,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:17:15,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:17:15,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:16,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:17:16,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:17:16,058 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:17:16,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:17:16,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:17:16,064 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:17:16,168 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:17:16,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:17:16 BoogieIcfgContainer [2025-03-04 01:17:16,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:17:16,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:17:16,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:17:16,171 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:17:16,172 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:07" (3/4) ... [2025-03-04 01:17:16,173 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:17:16,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:17:16,174 INFO L158 Benchmark]: Toolchain (without parser) took 9566.49ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 104.5MB in the beginning and 311.9MB in the end (delta: -207.4MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,174 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:17:16,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.89ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.10ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:17:16,175 INFO L158 Benchmark]: Boogie Preprocessor took 71.25ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 82.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,177 INFO L158 Benchmark]: IcfgBuilder took 522.17ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 49.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,177 INFO L158 Benchmark]: TraceAbstraction took 8665.28ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 48.7MB in the beginning and 312.0MB in the end (delta: -263.3MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,177 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 394.3MB. Free memory was 312.0MB in the beginning and 311.9MB in the end (delta: 124.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:17:16,178 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.24ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.89ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 89.5MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.10ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.25ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 82.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 522.17ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 49.8MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8665.28ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 48.7MB in the beginning and 312.0MB in the end (delta: -263.3MB). Peak memory consumption was 175.4MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 394.3MB. Free memory was 312.0MB in the beginning and 311.9MB in the end (delta: 124.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {1, 0, 0}, {0, 0, 0} }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0][0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1][0]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[0][1]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[1][1]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[0][2]); [L30] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer = &(BOOL_unsigned_char_Array_0[1][2]); [L31-L33] float float_Array_0[2] = { 16.5, 127.25 }; [L31-L33] float float_Array_0[2] = { 16.5, 127.25 }; [L31-L33] float float_Array_0[2] = { 16.5, 127.25 }; [L34] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L35] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L36-L38] signed long int signed_long_int_Array_0[1] = { -1 }; [L36-L38] signed long int signed_long_int_Array_0[1] = { -1 }; [L39] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L40-L42] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L40-L42] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L40-L42] unsigned char unsigned_char_Array_0[2] = { 4, 5 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=0, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L75] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L76] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L78] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L79] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L81] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L82] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L84] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L85] float_Array_0[1] = __VERIFIER_nondet_float() [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L86] EXPR float_Array_0[1] [L86] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L86] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L87] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L102] RET updateVariables() [L103] CALL step() [L48] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L48] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100) [L49] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L49] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f) [L49] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L49] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L49] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f))) [L50] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L50] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L50] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L53] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L53] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L53] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) [L55] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L55] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L55] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) <= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L56] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L56] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L56] COND TRUE (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L57] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer) [L57] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)) [L66] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L66] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L66] COND FALSE !((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) [L69] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L69] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L69] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L69] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L69] EXPR ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L69] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) = (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L94] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100))) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L94] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L94] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f))))) [L94] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L94] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f) [L94] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L94] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f)))))) && (((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f)))))) && (((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f)))))) && (((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) && (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) <= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)))) : 1) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) <= 1000000) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94] EXPR ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f)))))) && (((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) && (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) <= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)))) : 1) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) <= 1000000) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L94-L95] return ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) - 10))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 100)))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < (64.15f)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : (64.15f)))))) && (((- (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) || ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) <= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))))))) && (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) <= (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) ? (((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer)))) : 1) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) <= 1000000) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)) == ((unsigned char) 0)))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:4}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var5_Pointer={4:5}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 4587 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3177 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 783 IncrementalHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1410 mSDtfsCounter, 783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=11, InterpolantAutomatonStates: 59, 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, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1432 ConstructedInterpolants, 0 QuantifiedInterpolants, 6057 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1299 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 2874/3080 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:17:16,194 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-ap_file-42.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 6b42afb425befffe59b79424852c909b3e1036728d2e8fd866af9c27ec055fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:17:18,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:17:18,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:17:18,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:17:18,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:17:18,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:17:18,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:17:18,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:17:18,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:17:18,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:17:18,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:17:18,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:17:18,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:17:18,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:17:18,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:17:18,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:17:18,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:17:18,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:17:18,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:17:18,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:18,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:17:18,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:17:18,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:17:18,153 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 -> 6b42afb425befffe59b79424852c909b3e1036728d2e8fd866af9c27ec055fcd [2025-03-04 01:17:18,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:17:18,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:17:18,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:17:18,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:17:18,410 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:17:18,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:19,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a362553ad/a3fc33eeec9c40ab9067ef21fb463105/FLAG1831efb36 [2025-03-04 01:17:19,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:17:19,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:19,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a362553ad/a3fc33eeec9c40ab9067ef21fb463105/FLAG1831efb36 [2025-03-04 01:17:19,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a362553ad/a3fc33eeec9c40ab9067ef21fb463105 [2025-03-04 01:17:19,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:17:19,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:17:19,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:19,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:17:19,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:17:19,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:19,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613dd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19, skipping insertion in model container [2025-03-04 01:17:19,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:19,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:17:19,896 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-ap_file-42.i[917,930] [2025-03-04 01:17:19,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:19,950 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:17:19,958 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-ap_file-42.i[917,930] [2025-03-04 01:17:19,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:17:19,996 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:17:19,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19 WrapperNode [2025-03-04 01:17:19,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:17:19,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:19,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:17:19,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:17:20,002 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:17:19" (1/1) ... [2025-03-04 01:17:20,011 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:17:19" (1/1) ... [2025-03-04 01:17:20,031 INFO L138 Inliner]: procedures = 33, calls = 141, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-03-04 01:17:20,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:17:20,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:17:20,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:17:20,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:17:20,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,070 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 40, 21, 9, 43]. 37 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 6, 2, 1, 2]. The 15 writes are split as follows [0, 9, 2, 2, 2]. [2025-03-04 01:17:20,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:17:20,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:17:20,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:17:20,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:17:20,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (1/1) ... [2025-03-04 01:17:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:17:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:17:20,126 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:17:20,132 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:17:20,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:17:20,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:17:20,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:17:20,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:17:20,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:17:20,280 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:17:20,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:17:20,740 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-04 01:17:20,807 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-04 01:17:20,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:17:20,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:17:20,821 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:17:20,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:20 BoogieIcfgContainer [2025-03-04 01:17:20,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:17:20,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:17:20,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:17:20,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:17:20,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:17:19" (1/3) ... [2025-03-04 01:17:20,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0e39ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:20, skipping insertion in model container [2025-03-04 01:17:20,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:17:19" (2/3) ... [2025-03-04 01:17:20,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0e39ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:17:20, skipping insertion in model container [2025-03-04 01:17:20,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:17:20" (3/3) ... [2025-03-04 01:17:20,829 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-42.i [2025-03-04 01:17:20,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:17:20,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-42.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:17:20,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:17:20,894 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;@2121cda6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:17:20,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:17:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:20,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:20,907 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:20,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1254385902, now seen corresponding path program 1 times [2025-03-04 01:17:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223085983] [2025-03-04 01:17:20,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:20,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:20,922 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:17:20,925 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:17:21,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:21,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:17:21,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:17:21,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:21,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223085983] [2025-03-04 01:17:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223085983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:21,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:21,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:17:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103025899] [2025-03-04 01:17:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:17:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:21,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:17:21,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:17:21,207 INFO L87 Difference]: Start difference. First operand has 99 states, 85 states have (on average 1.411764705882353) internal successors, (120), 86 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:21,233 INFO L93 Difference]: Finished difference Result 192 states and 290 transitions. [2025-03-04 01:17:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:17:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:21,239 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:17:21,239 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:17:21,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:17:21,247 INFO L435 NwaCegarLoop]: 135 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, 135 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:17:21,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:17:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:17:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-03-04 01:17:21,283 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 103 [2025-03-04 01:17:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-03-04 01:17:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-03-04 01:17:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:21,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:21,286 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,293 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:17:21,487 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:17:21,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:21,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1303725911, now seen corresponding path program 1 times [2025-03-04 01:17:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:21,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742038034] [2025-03-04 01:17:21,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:21,488 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:17:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:21,490 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:17:21,492 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:17:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:21,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:21,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:21,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:21,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:17:21,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:17:21,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:21,733 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742038034] [2025-03-04 01:17:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742038034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:17:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516364192] [2025-03-04 01:17:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:17:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:21,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:17:21,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:21,735 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:21,771 INFO L93 Difference]: Finished difference Result 191 states and 270 transitions. [2025-03-04 01:17:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:17:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-04 01:17:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:21,773 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:17:21,773 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:21,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:17:21,774 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:21,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-03-04 01:17:21,786 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 103 [2025-03-04 01:17:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:21,790 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-03-04 01:17:21,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-03-04 01:17:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:21,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:21,791 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,800 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:17:21,992 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:17:21,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:21,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1063185782, now seen corresponding path program 1 times [2025-03-04 01:17:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:21,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124094460] [2025-03-04 01:17:21,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:21,994 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:17:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:21,995 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:17:21,997 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:17:22,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:22,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:22,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:17:22,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:17:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:22,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:22,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124094460] [2025-03-04 01:17:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124094460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:17:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737272705] [2025-03-04 01:17:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:22,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:17:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:22,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:17:22,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:22,217 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:22,243 INFO L93 Difference]: Finished difference Result 191 states and 268 transitions. [2025-03-04 01:17:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:17:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:22,244 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:17:22,244 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:17:22,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:22,245 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:22,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:17:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:17:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2025-03-04 01:17:22,252 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 103 [2025-03-04 01:17:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:22,252 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2025-03-04 01:17:22,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2025-03-04 01:17:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:22,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:22,253 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,261 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 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:22,454 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:17:22,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -926036346, now seen corresponding path program 1 times [2025-03-04 01:17:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790287820] [2025-03-04 01:17:22,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:22,455 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:17:22,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:22,457 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:17:22,458 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:17:22,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:22,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:22,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:22,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:22,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:17:22,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:23,049 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:17:23,050 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:17:23,147 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 26 treesize of output 22 [2025-03-04 01:17:23,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-04 01:17:23,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-03-04 01:17:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:17:23,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:23,737 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:17:23,738 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 30 treesize of output 29 [2025-03-04 01:17:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:17:23,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790287820] [2025-03-04 01:17:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790287820] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 23 [2025-03-04 01:17:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716374845] [2025-03-04 01:17:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:23,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:17:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:23,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:17:23,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:17:23,884 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:24,914 INFO L93 Difference]: Finished difference Result 231 states and 316 transitions. [2025-03-04 01:17:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:17:24,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-04 01:17:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:24,915 INFO L225 Difference]: With dead ends: 231 [2025-03-04 01:17:24,916 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:17:24,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:17:24,917 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 419 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:24,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 810 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:17:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:17:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 102. [2025-03-04 01:17:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 138 transitions. [2025-03-04 01:17:24,927 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 138 transitions. Word has length 103 [2025-03-04 01:17:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:24,927 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 138 transitions. [2025-03-04 01:17:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:17:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 138 transitions. [2025-03-04 01:17:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:24,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:24,928 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:24,934 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:17:25,133 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:17:25,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:25,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1571979591, now seen corresponding path program 1 times [2025-03-04 01:17:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694102117] [2025-03-04 01:17:25,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:25,134 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:17:25,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:25,136 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:17:25,138 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:17:25,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:25,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:25,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:25,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:25,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:17:25,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:25,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:17:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:25,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:25,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694102117] [2025-03-04 01:17:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694102117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:17:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895326407] [2025-03-04 01:17:25,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:17:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:25,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:17:25,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:25,298 INFO L87 Difference]: Start difference. First operand 102 states and 138 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:25,313 INFO L93 Difference]: Finished difference Result 197 states and 268 transitions. [2025-03-04 01:17:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:17:25,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:25,314 INFO L225 Difference]: With dead ends: 197 [2025-03-04 01:17:25,315 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:25,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:17:25,315 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:25,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:25,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2025-03-04 01:17:25,328 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 103 [2025-03-04 01:17:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2025-03-04 01:17:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2025-03-04 01:17:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:25,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:25,329 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:25,335 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 (6)] Ended with exit code 0 [2025-03-04 01:17:25,529 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:17:25,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:25,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1908324362, now seen corresponding path program 1 times [2025-03-04 01:17:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820474357] [2025-03-04 01:17:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:25,531 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:17:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:25,532 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:17:25,533 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:17:25,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:25,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:25,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:25,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:25,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:17:25,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:25,956 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:17:25,956 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:17:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:17:26,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:26,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820474357] [2025-03-04 01:17:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820474357] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-04 01:17:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755801091] [2025-03-04 01:17:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:26,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:26,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:17:26,224 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:26,426 INFO L93 Difference]: Finished difference Result 239 states and 321 transitions. [2025-03-04 01:17:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:17:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:26,427 INFO L225 Difference]: With dead ends: 239 [2025-03-04 01:17:26,428 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 01:17:26,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:17:26,429 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:26,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 847 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 01:17:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2025-03-04 01:17:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2025-03-04 01:17:26,438 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 103 [2025-03-04 01:17:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:26,439 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2025-03-04 01:17:26,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2025-03-04 01:17:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:26,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:26,440 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,448 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:17:26,640 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:17:26,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -168884981, now seen corresponding path program 1 times [2025-03-04 01:17:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72615180] [2025-03-04 01:17:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:26,642 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:17:26,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:26,643 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:17:26,644 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:17:26,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:26,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:17:26,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:27,067 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:17:27,067 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:17:27,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2025-03-04 01:17:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:17:27,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:27,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72615180] [2025-03-04 01:17:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72615180] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:27,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:27,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 01:17:27,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118218916] [2025-03-04 01:17:27,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:27,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:17:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:27,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:17:27,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:17:27,257 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:27,272 INFO L93 Difference]: Finished difference Result 193 states and 259 transitions. [2025-03-04 01:17:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:17:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-03-04 01:17:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:27,275 INFO L225 Difference]: With dead ends: 193 [2025-03-04 01:17:27,275 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:17:27,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:17:27,277 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:27,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:17:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:17:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:17:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2025-03-04 01:17:27,290 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 103 [2025-03-04 01:17:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:27,291 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2025-03-04 01:17:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2025-03-04 01:17:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:27,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:27,292 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,297 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 (8)] Ended with exit code 0 [2025-03-04 01:17:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:17:27,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:27,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash -674443606, now seen corresponding path program 1 times [2025-03-04 01:17:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647486776] [2025-03-04 01:17:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:27,493 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:17:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:27,494 INFO L229 MonitoredProcess]: Starting monitored process 9 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:17:27,495 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 (9)] Waiting until timeout for monitored process [2025-03-04 01:17:27,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:27,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:27,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:27,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:17:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:27,717 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:17:27,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-04 01:17:28,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 01:17:28,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 01:17:28,739 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2025-03-04 01:17:28,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 48 [2025-03-04 01:17:28,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:28,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 30 [2025-03-04 01:17:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 132 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 01:17:28,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:28,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:28,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647486776] [2025-03-04 01:17:28,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647486776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:28,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [286109701] [2025-03-04 01:17:28,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:28,892 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:17:28,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:17:28,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:17:29,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:29,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:29,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:29,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:29,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:17:29,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:29,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:17:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-04 01:17:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-04 01:17:30,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-03-04 01:17:30,753 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2025-03-04 01:17:30,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 52 [2025-03-04 01:17:30,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2025-03-04 01:17:30,829 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 132 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 01:17:30,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [286109701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:30,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 01:17:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468810593] [2025-03-04 01:17:30,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:30,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:17:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:30,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:17:30,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:17:30,890 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 19 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 8 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 01:17:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:32,044 INFO L93 Difference]: Finished difference Result 221 states and 288 transitions. [2025-03-04 01:17:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:17:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 8 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) Word has length 103 [2025-03-04 01:17:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:32,046 INFO L225 Difference]: With dead ends: 221 [2025-03-04 01:17:32,046 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 01:17:32,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:17:32,047 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 404 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:32,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 863 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:17:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 01:17:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2025-03-04 01:17:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:17:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2025-03-04 01:17:32,063 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 103 [2025-03-04 01:17:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:32,064 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2025-03-04 01:17:32,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 8 states have call successors, (22), 6 states have call predecessors, (22), 8 states have return successors, (22), 7 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 01:17:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2025-03-04 01:17:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:17:32,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:32,064 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:32,072 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 (9)] Ended with exit code 0 [2025-03-04 01:17:32,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:17:32,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:32,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:32,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2100385771, now seen corresponding path program 1 times [2025-03-04 01:17:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:32,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296611067] [2025-03-04 01:17:32,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:32,466 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:17:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:32,468 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:32,469 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 (11)] Waiting until timeout for monitored process [2025-03-04 01:17:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:32,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:32,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:32,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:32,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:17:32,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:33,206 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 01:17:33,206 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 1 case distinctions, treesize of input 103 treesize of output 59 [2025-03-04 01:17:33,340 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 01:17:33,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 58 [2025-03-04 01:17:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:17:33,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:34,256 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296611067] [2025-03-04 01:17:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296611067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:34,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974142484] [2025-03-04 01:17:34,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:17:34,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:17:34,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:17:34,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:17:34,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:17:34,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:34,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:34,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:17:34,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:35,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:17:36,054 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-04 01:17:36,055 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 1 case distinctions, treesize of input 103 treesize of output 59 [2025-03-04 01:17:36,274 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:17:36,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 58 [2025-03-04 01:17:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:17:36,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1974142484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:36,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-04 01:17:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875330988] [2025-03-04 01:17:36,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:17:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:36,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:17:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:17:36,988 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 01:17:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:38,731 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2025-03-04 01:17:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:17:38,733 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 103 [2025-03-04 01:17:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:38,734 INFO L225 Difference]: With dead ends: 306 [2025-03-04 01:17:38,734 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 01:17:38,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=217, Invalid=1189, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:17:38,735 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 387 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:38,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1428 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 776 Invalid, 1 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:17:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 01:17:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2025-03-04 01:17:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 169 states have internal predecessors, (207), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 251 transitions. [2025-03-04 01:17:38,762 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 251 transitions. Word has length 103 [2025-03-04 01:17:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:38,762 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 251 transitions. [2025-03-04 01:17:38,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 20 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 01:17:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2025-03-04 01:17:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:17:38,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:38,763 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:38,769 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 (11)] Ended with exit code 0 [2025-03-04 01:17:38,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:17:39,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:39,164 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:39,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1676897738, now seen corresponding path program 1 times [2025-03-04 01:17:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:39,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26284984] [2025-03-04 01:17:39,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:39,165 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:17:39,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:39,167 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17:39,168 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 (13)] Waiting until timeout for monitored process [2025-03-04 01:17:39,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:39,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:39,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:39,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:39,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:17:39,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:39,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2025-03-04 01:17:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:17:39,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:39,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 25 [2025-03-04 01:17:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:17:39,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26284984] [2025-03-04 01:17:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26284984] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:17:39,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-04 01:17:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100092782] [2025-03-04 01:17:39,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:17:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:17:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:39,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:17:39,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:17:39,539 INFO L87 Difference]: Start difference. First operand 200 states and 251 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 01:17:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:39,864 INFO L93 Difference]: Finished difference Result 422 states and 526 transitions. [2025-03-04 01:17:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:17:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 105 [2025-03-04 01:17:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:39,868 INFO L225 Difference]: With dead ends: 422 [2025-03-04 01:17:39,868 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:17:39,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:17:39,869 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:39,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 650 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:17:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:17:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2025-03-04 01:17:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.2228915662650603) internal successors, (203), 167 states have internal predecessors, (203), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2025-03-04 01:17:39,895 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 105 [2025-03-04 01:17:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:39,895 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2025-03-04 01:17:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-03-04 01:17:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2025-03-04 01:17:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:17:39,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:39,896 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:39,902 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 (13)] Ended with exit code 0 [2025-03-04 01:17:40,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:17:40,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:40,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1848899543, now seen corresponding path program 1 times [2025-03-04 01:17:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161857491] [2025-03-04 01:17:40,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:40,098 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:17:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:40,101 INFO L229 MonitoredProcess]: Starting monitored process 14 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:17:40,102 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 (14)] Waiting until timeout for monitored process [2025-03-04 01:17:40,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:40,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:40,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:40,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:40,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:17:40,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-03-04 01:17:41,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:41,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 44 [2025-03-04 01:17:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:17:41,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:41,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:41,458 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 84 treesize of output 75 [2025-03-04 01:17:41,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-04 01:17:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:17:41,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161857491] [2025-03-04 01:17:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161857491] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:41,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:41,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 17 [2025-03-04 01:17:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194318893] [2025-03-04 01:17:41,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:41,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:17:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:41,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:17:41,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:17:41,984 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:17:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:42,178 INFO L93 Difference]: Finished difference Result 440 states and 547 transitions. [2025-03-04 01:17:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:17:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2025-03-04 01:17:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:42,180 INFO L225 Difference]: With dead ends: 440 [2025-03-04 01:17:42,180 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 01:17:42,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 166 SyntacticMatches, 27 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:17:42,181 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 235 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:42,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 436 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:17:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 01:17:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 202. [2025-03-04 01:17:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2176470588235293) internal successors, (207), 171 states have internal predecessors, (207), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2025-03-04 01:17:42,207 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 105 [2025-03-04 01:17:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:42,207 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2025-03-04 01:17:42,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 3 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 01:17:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2025-03-04 01:17:42,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:17:42,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:42,208 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:42,214 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 (14)] Ended with exit code 0 [2025-03-04 01:17:42,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:17:42,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:42,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash 51948184, now seen corresponding path program 1 times [2025-03-04 01:17:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156104932] [2025-03-04 01:17:42,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:42,411 INFO L229 MonitoredProcess]: Starting monitored process 15 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:17:42,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 (15)] Waiting until timeout for monitored process [2025-03-04 01:17:42,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:17:42,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:17:42,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:42,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:42,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:17:42,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:42,804 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:17:42,804 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:17:42,873 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 26 treesize of output 22 [2025-03-04 01:17:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-04 01:17:42,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-03-04 01:17:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:17:43,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:43,140 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156104932] [2025-03-04 01:17:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156104932] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:43,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2025-03-04 01:17:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164466315] [2025-03-04 01:17:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:17:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:43,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:17:43,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:17:43,141 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:43,389 INFO L93 Difference]: Finished difference Result 468 states and 574 transitions. [2025-03-04 01:17:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:17:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-03-04 01:17:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:43,390 INFO L225 Difference]: With dead ends: 468 [2025-03-04 01:17:43,390 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 01:17:43,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:17:43,391 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:43,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 885 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:17:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 01:17:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 198. [2025-03-04 01:17:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2025-03-04 01:17:43,420 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 105 [2025-03-04 01:17:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:43,420 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2025-03-04 01:17:43,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2025-03-04 01:17:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:17:43,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:43,421 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:43,427 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 (15)] Ended with exit code 0 [2025-03-04 01:17:43,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:17:43,621 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:43,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1217626325, now seen corresponding path program 1 times [2025-03-04 01:17:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405226886] [2025-03-04 01:17:43,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:43,622 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:17:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:43,624 INFO L229 MonitoredProcess]: Starting monitored process 16 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:17:43,624 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 (16)] Waiting until timeout for monitored process [2025-03-04 01:17:43,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:43,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:43,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:43,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:43,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 01:17:43,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:44,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 57 [2025-03-04 01:17:45,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:17:45,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 56 [2025-03-04 01:17:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:17:45,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:46,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405226886] [2025-03-04 01:17:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405226886] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:46,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 23 [2025-03-04 01:17:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023698073] [2025-03-04 01:17:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:46,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:17:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:46,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:17:46,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:17:46,251 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:47,435 INFO L93 Difference]: Finished difference Result 577 states and 717 transitions. [2025-03-04 01:17:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:17:47,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:17:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:47,437 INFO L225 Difference]: With dead ends: 577 [2025-03-04 01:17:47,437 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 01:17:47,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:17:47,439 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 354 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:47,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 733 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:17:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 01:17:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 232. [2025-03-04 01:17:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 200 states have (on average 1.21) internal successors, (242), 201 states have internal predecessors, (242), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2025-03-04 01:17:47,471 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 107 [2025-03-04 01:17:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:47,471 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2025-03-04 01:17:47,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2025-03-04 01:17:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:17:47,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:47,472 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,481 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 (16)] Ended with exit code 0 [2025-03-04 01:17:47,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:17:47,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:47,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1021112820, now seen corresponding path program 1 times [2025-03-04 01:17:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760333002] [2025-03-04 01:17:47,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:47,673 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:17:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:47,675 INFO L229 MonitoredProcess]: Starting monitored process 17 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:17:47,675 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 (17)] Waiting until timeout for monitored process [2025-03-04 01:17:47,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:47,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:17:47,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:47,953 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 01:17:47,953 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 1 case distinctions, treesize of input 78 treesize of output 46 [2025-03-04 01:17:48,122 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 01:17:48,123 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 84 treesize of output 36 [2025-03-04 01:17:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:48,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:48,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760333002] [2025-03-04 01:17:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760333002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:48,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:17:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577154767] [2025-03-04 01:17:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:48,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:48,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:17:48,158 INFO L87 Difference]: Start difference. First operand 232 states and 286 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:48,604 INFO L93 Difference]: Finished difference Result 470 states and 576 transitions. [2025-03-04 01:17:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:17:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:17:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:48,606 INFO L225 Difference]: With dead ends: 470 [2025-03-04 01:17:48,606 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 01:17:48,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:17:48,606 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 222 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:48,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 536 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:17:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 01:17:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 209. [2025-03-04 01:17:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.192090395480226) internal successors, (211), 178 states have internal predecessors, (211), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:17:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 255 transitions. [2025-03-04 01:17:48,639 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 255 transitions. Word has length 107 [2025-03-04 01:17:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:48,641 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 255 transitions. [2025-03-04 01:17:48,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 255 transitions. [2025-03-04 01:17:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:17:48,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:48,641 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:48,648 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 (17)] Ended with exit code 0 [2025-03-04 01:17:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:17:48,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1228942452, now seen corresponding path program 1 times [2025-03-04 01:17:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008117374] [2025-03-04 01:17:48,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:48,842 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:17:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:48,844 INFO L229 MonitoredProcess]: Starting monitored process 18 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:17:48,845 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 (18)] Waiting until timeout for monitored process [2025-03-04 01:17:48,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:49,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:49,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:49,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:49,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:17:49,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:50,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31 [2025-03-04 01:17:50,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 33 [2025-03-04 01:17:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:17:50,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:50,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:50,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008117374] [2025-03-04 01:17:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008117374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:50,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [935750862] [2025-03-04 01:17:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:50,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:17:50,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:17:50,645 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:17:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-04 01:17:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:51,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:17:51,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:52,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 31 [2025-03-04 01:17:53,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 48 [2025-03-04 01:17:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:17:53,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [935750862] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:17:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 15] total 34 [2025-03-04 01:17:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106563804] [2025-03-04 01:17:54,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:17:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:54,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:17:54,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:17:54,083 INFO L87 Difference]: Start difference. First operand 209 states and 255 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:55,494 INFO L93 Difference]: Finished difference Result 528 states and 642 transitions. [2025-03-04 01:17:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:17:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:17:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:55,496 INFO L225 Difference]: With dead ends: 528 [2025-03-04 01:17:55,496 INFO L226 Difference]: Without dead ends: 322 [2025-03-04 01:17:55,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=234, Invalid=1406, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:17:55,497 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 198 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:55,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1069 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:17:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-04 01:17:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 181. [2025-03-04 01:17:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 159 states have (on average 1.1823899371069182) internal successors, (188), 159 states have internal predecessors, (188), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:17:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2025-03-04 01:17:55,522 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 107 [2025-03-04 01:17:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:55,523 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2025-03-04 01:17:55,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2025-03-04 01:17:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:17:55,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:55,524 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:55,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-04 01:17:55,731 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 (18)] Forceful destruction successful, exit code 0 [2025-03-04 01:17:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /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:17:55,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1032428947, now seen corresponding path program 1 times [2025-03-04 01:17:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013934738] [2025-03-04 01:17:55,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:17:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:55,927 INFO L229 MonitoredProcess]: Starting monitored process 20 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:17:55,928 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 (20)] Waiting until timeout for monitored process [2025-03-04 01:17:56,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:56,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:56,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:56,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:56,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:17:56,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:56,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:56,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-04 01:17:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:56,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:56,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013934738] [2025-03-04 01:17:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013934738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:17:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631095127] [2025-03-04 01:17:56,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:56,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:56,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:17:56,276 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:56,704 INFO L93 Difference]: Finished difference Result 416 states and 500 transitions. [2025-03-04 01:17:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:17:56,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:17:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:56,706 INFO L225 Difference]: With dead ends: 416 [2025-03-04 01:17:56,706 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 01:17:56,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:17:56,706 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 156 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:56,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1139 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:17:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 01:17:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 181. [2025-03-04 01:17:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 159 states have (on average 1.1823899371069182) internal successors, (188), 159 states have internal predecessors, (188), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:17:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2025-03-04 01:17:56,728 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 107 [2025-03-04 01:17:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2025-03-04 01:17:56,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2025-03-04 01:17:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:17:56,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:56,729 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:56,736 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 (20)] Ended with exit code 0 [2025-03-04 01:17:56,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:17:56,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 467248340, now seen corresponding path program 1 times [2025-03-04 01:17:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899110743] [2025-03-04 01:17:56,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:56,932 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:17:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:56,934 INFO L229 MonitoredProcess]: Starting monitored process 21 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:17:56,935 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 (21)] Waiting until timeout for monitored process [2025-03-04 01:17:57,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:17:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:17:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:57,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:17:57,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:57,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:17:57,355 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 01:17:57,355 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 85 treesize of output 46 [2025-03-04 01:17:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:57,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:17:57,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:57,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899110743] [2025-03-04 01:17:57,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899110743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:17:57,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:17:57,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:17:57,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926104473] [2025-03-04 01:17:57,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:57,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:17:57,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:57,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:17:57,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:17:57,400 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:17:58,116 INFO L93 Difference]: Finished difference Result 470 states and 565 transitions. [2025-03-04 01:17:58,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:17:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-03-04 01:17:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:17:58,118 INFO L225 Difference]: With dead ends: 470 [2025-03-04 01:17:58,118 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 01:17:58,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:17:58,119 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 219 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:17:58,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1145 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:17:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 01:17:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 159. [2025-03-04 01:17:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.167883211678832) internal successors, (160), 137 states have internal predecessors, (160), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:17:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2025-03-04 01:17:58,142 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 107 [2025-03-04 01:17:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:17:58,142 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2025-03-04 01:17:58,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:17:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2025-03-04 01:17:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:17:58,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:17:58,142 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:58,148 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 (21)] Ended with exit code 0 [2025-03-04 01:17:58,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:17:58,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:17:58,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:17:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1114541938, now seen corresponding path program 1 times [2025-03-04 01:17:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:17:58,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971416148] [2025-03-04 01:17:58,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:17:58,344 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:17:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:17:58,346 INFO L229 MonitoredProcess]: Starting monitored process 22 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:17:58,346 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 (22)] Waiting until timeout for monitored process [2025-03-04 01:17:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:17:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:17:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:17:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:17:58,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:17:58,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:17:58,914 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 01:17:58,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 46 [2025-03-04 01:17:59,231 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 01:17:59,231 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 105 treesize of output 45 [2025-03-04 01:17:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 102 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 01:17:59,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:17:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:17:59,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:17:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971416148] [2025-03-04 01:17:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971416148] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:17:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:17:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2025-03-04 01:17:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799883737] [2025-03-04 01:17:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:17:59,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:17:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:17:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:17:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:17:59,725 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:00,669 INFO L93 Difference]: Finished difference Result 424 states and 508 transitions. [2025-03-04 01:18:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:18:00,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:00,671 INFO L225 Difference]: With dead ends: 424 [2025-03-04 01:18:00,671 INFO L226 Difference]: Without dead ends: 268 [2025-03-04 01:18:00,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:18:00,672 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 286 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:00,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 901 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:18:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-04 01:18:00,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 172. [2025-03-04 01:18:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.1533333333333333) internal successors, (173), 150 states have internal predecessors, (173), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2025-03-04 01:18:00,697 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 111 [2025-03-04 01:18:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:00,698 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2025-03-04 01:18:00,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2025-03-04 01:18:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:00,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:00,698 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:00,704 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 (22)] Ended with exit code 0 [2025-03-04 01:18:00,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:18:00,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:00,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -550674009, now seen corresponding path program 1 times [2025-03-04 01:18:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:00,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78183236] [2025-03-04 01:18:00,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:00,900 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:18:00,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:00,901 INFO L229 MonitoredProcess]: Starting monitored process 23 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:18:00,903 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 (23)] Waiting until timeout for monitored process [2025-03-04 01:18:00,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:01,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:01,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:01,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:01,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:18:01,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:01,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:01,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-04 01:18:01,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 01:18:02,496 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2025-03-04 01:18:02,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 48 [2025-03-04 01:18:02,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-04 01:18:02,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 38 [2025-03-04 01:18:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 35 proven. 126 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 01:18:02,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:03,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:03,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78183236] [2025-03-04 01:18:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78183236] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 22 [2025-03-04 01:18:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683677937] [2025-03-04 01:18:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:03,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:18:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:03,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:18:03,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:18:03,242 INFO L87 Difference]: Start difference. First operand 172 states and 201 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:03,621 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2025-03-04 01:18:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:18:03,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:03,622 INFO L225 Difference]: With dead ends: 398 [2025-03-04 01:18:03,622 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 01:18:03,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:18:03,623 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 40 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:03,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1042 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 01:18:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2025-03-04 01:18:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 183 states have (on average 1.1366120218579234) internal successors, (208), 183 states have internal predecessors, (208), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 236 transitions. [2025-03-04 01:18:03,646 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 236 transitions. Word has length 111 [2025-03-04 01:18:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:03,646 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 236 transitions. [2025-03-04 01:18:03,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 236 transitions. [2025-03-04 01:18:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:03,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:03,647 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:03,654 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 (23)] Ended with exit code 0 [2025-03-04 01:18:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:18:03,847 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1936838824, now seen corresponding path program 1 times [2025-03-04 01:18:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345636819] [2025-03-04 01:18:03,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:03,848 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:18:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:03,850 INFO L229 MonitoredProcess]: Starting monitored process 24 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:18:03,850 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 (24)] Waiting until timeout for monitored process [2025-03-04 01:18:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:04,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:04,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:04,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:04,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:18:04,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:04,243 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:18:04,243 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:18:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2025-03-04 01:18:05,095 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 01:18:05,095 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 82 treesize of output 55 [2025-03-04 01:18:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:18:05,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:05,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345636819] [2025-03-04 01:18:05,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345636819] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:05,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:05,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 25 [2025-03-04 01:18:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37613079] [2025-03-04 01:18:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:05,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:18:05,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:05,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:18:05,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:18:05,389 INFO L87 Difference]: Start difference. First operand 205 states and 236 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:05,696 INFO L93 Difference]: Finished difference Result 407 states and 469 transitions. [2025-03-04 01:18:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:18:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:05,698 INFO L225 Difference]: With dead ends: 407 [2025-03-04 01:18:05,698 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 01:18:05,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:18:05,699 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 234 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:05,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 372 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:18:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 01:18:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-04 01:18:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 183 states have (on average 1.1256830601092895) internal successors, (206), 183 states have internal predecessors, (206), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 234 transitions. [2025-03-04 01:18:05,724 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 234 transitions. Word has length 111 [2025-03-04 01:18:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:05,724 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 234 transitions. [2025-03-04 01:18:05,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 234 transitions. [2025-03-04 01:18:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:05,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:05,725 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:05,731 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 (24)] Ended with exit code 0 [2025-03-04 01:18:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:18:05,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:05,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -617680762, now seen corresponding path program 1 times [2025-03-04 01:18:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522506759] [2025-03-04 01:18:05,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:05,926 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:18:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:05,928 INFO L229 MonitoredProcess]: Starting monitored process 25 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:18:05,928 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 (25)] Waiting until timeout for monitored process [2025-03-04 01:18:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:06,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:06,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:06,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:06,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:18:06,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:06,303 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2025-03-04 01:18:06,303 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 1 case distinctions, treesize of input 31 treesize of output 34 [2025-03-04 01:18:06,428 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 16 treesize of output 12 [2025-03-04 01:18:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 01:18:07,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:07,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:07,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522506759] [2025-03-04 01:18:07,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522506759] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:07,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:18:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 26 [2025-03-04 01:18:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788720572] [2025-03-04 01:18:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:07,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:18:07,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:07,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:18:07,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:18:07,464 INFO L87 Difference]: Start difference. First operand 205 states and 234 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:08,228 INFO L93 Difference]: Finished difference Result 554 states and 633 transitions. [2025-03-04 01:18:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:18:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:08,230 INFO L225 Difference]: With dead ends: 554 [2025-03-04 01:18:08,230 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 01:18:08,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=878, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:18:08,231 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 471 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:08,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 943 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:18:08,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 01:18:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 204. [2025-03-04 01:18:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.120879120879121) internal successors, (204), 182 states have internal predecessors, (204), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2025-03-04 01:18:08,257 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 111 [2025-03-04 01:18:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:08,257 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2025-03-04 01:18:08,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2025-03-04 01:18:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:08,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:08,258 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,264 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 (25)] Ended with exit code 0 [2025-03-04 01:18:08,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:18:08,461 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475312, now seen corresponding path program 1 times [2025-03-04 01:18:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010847321] [2025-03-04 01:18:08,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:08,462 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:18:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:08,463 INFO L229 MonitoredProcess]: Starting monitored process 26 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:18:08,464 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 (26)] Waiting until timeout for monitored process [2025-03-04 01:18:08,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:08,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:08,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:08,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:18:08,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:08,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:08,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:08,966 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 111 treesize of output 63 [2025-03-04 01:18:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:09,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:09,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010847321] [2025-03-04 01:18:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010847321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:18:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906314047] [2025-03-04 01:18:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:18:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:09,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:18:09,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:18:09,010 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:10,371 INFO L93 Difference]: Finished difference Result 569 states and 651 transitions. [2025-03-04 01:18:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:18:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:10,373 INFO L225 Difference]: With dead ends: 569 [2025-03-04 01:18:10,373 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 01:18:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:18:10,375 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 264 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:10,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1168 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:18:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 01:18:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 236. [2025-03-04 01:18:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 214 states have (on average 1.1168224299065421) internal successors, (239), 214 states have internal predecessors, (239), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2025-03-04 01:18:10,402 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 111 [2025-03-04 01:18:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:10,402 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2025-03-04 01:18:10,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2025-03-04 01:18:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:10,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:10,403 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:10,409 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 (26)] Ended with exit code 0 [2025-03-04 01:18:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:18:10,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -539859568, now seen corresponding path program 1 times [2025-03-04 01:18:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835044049] [2025-03-04 01:18:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:10,604 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:18:10,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:10,606 INFO L229 MonitoredProcess]: Starting monitored process 27 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:18:10,607 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 (27)] Waiting until timeout for monitored process [2025-03-04 01:18:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:10,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:10,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:10,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:10,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:18:10,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:10,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:10,956 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 01:18:10,957 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 106 treesize of output 55 [2025-03-04 01:18:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:10,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:10,984 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835044049] [2025-03-04 01:18:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835044049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:10,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:18:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178140433] [2025-03-04 01:18:10,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:10,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:18:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:10,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:18:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:18:10,985 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:11,410 INFO L93 Difference]: Finished difference Result 581 states and 660 transitions. [2025-03-04 01:18:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:18:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:11,412 INFO L225 Difference]: With dead ends: 581 [2025-03-04 01:18:11,412 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:18:11,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:18:11,413 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 176 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:11,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1198 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:18:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:18:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 190. [2025-03-04 01:18:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 168 states have (on average 1.119047619047619) internal successors, (188), 168 states have internal predecessors, (188), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2025-03-04 01:18:11,439 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 111 [2025-03-04 01:18:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:11,439 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2025-03-04 01:18:11,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2025-03-04 01:18:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:11,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:11,441 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:11,446 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 (27)] Ended with exit code 0 [2025-03-04 01:18:11,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:18:11,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash 423903339, now seen corresponding path program 1 times [2025-03-04 01:18:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:11,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301423107] [2025-03-04 01:18:11,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:11,642 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:18:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:11,644 INFO L229 MonitoredProcess]: Starting monitored process 28 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:18:11,645 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 (28)] Waiting until timeout for monitored process [2025-03-04 01:18:11,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:11,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:18:11,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:11,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:12,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2025-03-04 01:18:12,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-04 01:18:12,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2025-03-04 01:18:13,516 INFO L349 Elim1Store]: treesize reduction 67, result has 18.3 percent of original size [2025-03-04 01:18:13,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 70 [2025-03-04 01:18:13,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 58 [2025-03-04 01:18:13,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:18:13,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 38 [2025-03-04 01:18:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 39 proven. 132 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 01:18:13,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:24,244 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301423107] [2025-03-04 01:18:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301423107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1268989765] [2025-03-04 01:18:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:24,244 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:18:24,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:18:24,246 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:18:24,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2025-03-04 01:18:24,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:24,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:24,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:24,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:18:24,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:24,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:18:25,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 01:18:25,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 01:18:25,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 01:18:26,401 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2025-03-04 01:18:26,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 47 [2025-03-04 01:18:26,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2025-03-04 01:18:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 120 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 01:18:26,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1268989765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:18:31,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2025-03-04 01:18:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234712445] [2025-03-04 01:18:31,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:18:31,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:18:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:31,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:18:31,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=564, Unknown=3, NotChecked=0, Total=702 [2025-03-04 01:18:31,261 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand has 21 states, 20 states have (on average 6.35) internal successors, (127), 19 states have internal predecessors, (127), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 01:18:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:32,865 INFO L93 Difference]: Finished difference Result 387 states and 439 transitions. [2025-03-04 01:18:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:18:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.35) internal successors, (127), 19 states have internal predecessors, (127), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 111 [2025-03-04 01:18:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:32,867 INFO L225 Difference]: With dead ends: 387 [2025-03-04 01:18:32,867 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 01:18:32,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=477, Invalid=1326, Unknown=3, NotChecked=0, Total=1806 [2025-03-04 01:18:32,868 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 762 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:32,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 427 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:18:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 01:18:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2025-03-04 01:18:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 168 states have internal predecessors, (187), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-03-04 01:18:32,896 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 111 [2025-03-04 01:18:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-03-04 01:18:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.35) internal successors, (127), 19 states have internal predecessors, (127), 8 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 01:18:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-03-04 01:18:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:18:32,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:32,897 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:32,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2025-03-04 01:18:33,103 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 (28)] Ended with exit code 0 [2025-03-04 01:18:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /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:18:33,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1241312608, now seen corresponding path program 1 times [2025-03-04 01:18:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062913797] [2025-03-04 01:18:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:33,298 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:18:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:33,300 INFO L229 MonitoredProcess]: Starting monitored process 30 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:18:33,301 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 (30)] Waiting until timeout for monitored process [2025-03-04 01:18:33,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:18:33,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:18:33,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:33,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:18:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:33,792 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 01:18:33,792 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 161 treesize of output 65 [2025-03-04 01:18:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:33,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:33,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062913797] [2025-03-04 01:18:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062913797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:33,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:33,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:18:33,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418168343] [2025-03-04 01:18:33,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:33,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:18:33,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:33,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:18:33,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:18:33,849 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:34,498 INFO L93 Difference]: Finished difference Result 507 states and 575 transitions. [2025-03-04 01:18:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:18:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-03-04 01:18:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:34,500 INFO L225 Difference]: With dead ends: 507 [2025-03-04 01:18:34,500 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 01:18:34,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:18:34,501 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 132 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:34,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1110 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:18:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 01:18:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 190. [2025-03-04 01:18:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 168 states have (on average 1.1071428571428572) internal successors, (186), 168 states have internal predecessors, (186), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2025-03-04 01:18:34,530 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 111 [2025-03-04 01:18:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:34,530 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-03-04 01:18:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2025-03-04 01:18:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:18:34,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:34,531 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,538 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 (30)] Forceful destruction successful, exit code 0 [2025-03-04 01:18:34,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:18:34,732 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1017283168, now seen corresponding path program 1 times [2025-03-04 01:18:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204108121] [2025-03-04 01:18:34,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:34,733 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:18:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:34,734 INFO L229 MonitoredProcess]: Starting monitored process 31 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:18:34,735 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 (31)] Waiting until timeout for monitored process [2025-03-04 01:18:34,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:18:34,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:18:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:34,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:18:34,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:34,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:35,312 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 01:18:35,312 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 106 treesize of output 55 [2025-03-04 01:18:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:35,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:35,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:35,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204108121] [2025-03-04 01:18:35,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204108121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:35,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:35,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:18:35,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564740969] [2025-03-04 01:18:35,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:35,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:18:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:35,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:18:35,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:18:35,378 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:36,747 INFO L93 Difference]: Finished difference Result 510 states and 576 transitions. [2025-03-04 01:18:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:18:36,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-03-04 01:18:36,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:36,749 INFO L225 Difference]: With dead ends: 510 [2025-03-04 01:18:36,749 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 01:18:36,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:18:36,750 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 260 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:36,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1053 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:18:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 01:18:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 192. [2025-03-04 01:18:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 170 states have (on average 1.1058823529411765) internal successors, (188), 170 states have internal predecessors, (188), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2025-03-04 01:18:36,788 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 113 [2025-03-04 01:18:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2025-03-04 01:18:36,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2025-03-04 01:18:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:18:36,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:36,789 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,796 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 (31)] Ended with exit code 0 [2025-03-04 01:18:36,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:18:36,990 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:36,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1164430656, now seen corresponding path program 1 times [2025-03-04 01:18:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031984137] [2025-03-04 01:18:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:36,991 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:18:36,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:36,993 INFO L229 MonitoredProcess]: Starting monitored process 32 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:18:36,994 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 (32)] Waiting until timeout for monitored process [2025-03-04 01:18:37,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:18:37,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:18:37,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:37,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:37,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:18:37,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:37,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:18:37,313 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-04 01:18:37,314 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 106 treesize of output 55 [2025-03-04 01:18:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:18:37,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:18:37,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031984137] [2025-03-04 01:18:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031984137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:18:37,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:18:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:18:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692726469] [2025-03-04 01:18:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:18:37,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:18:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:37,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:18:37,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:18:37,343 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:18:37,748 INFO L93 Difference]: Finished difference Result 473 states and 533 transitions. [2025-03-04 01:18:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:18:37,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2025-03-04 01:18:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:18:37,749 INFO L225 Difference]: With dead ends: 473 [2025-03-04 01:18:37,749 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 01:18:37,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:18:37,750 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 168 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:18:37,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1007 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:18:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 01:18:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 169. [2025-03-04 01:18:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 147 states have (on average 1.1020408163265305) internal successors, (162), 147 states have internal predecessors, (162), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:18:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2025-03-04 01:18:37,783 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 113 [2025-03-04 01:18:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:18:37,784 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2025-03-04 01:18:37,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:18:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2025-03-04 01:18:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:18:37,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:18:37,784 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,790 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 (32)] Ended with exit code 0 [2025-03-04 01:18:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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:18:37,985 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:18:37,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:18:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1969436389, now seen corresponding path program 1 times [2025-03-04 01:18:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:18:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850381562] [2025-03-04 01:18:37,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:18:37,986 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:18:37,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:18:37,988 INFO L229 MonitoredProcess]: Starting monitored process 33 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:18:37,988 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 (33)] Waiting until timeout for monitored process [2025-03-04 01:18:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:18:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:18:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:18:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:18:38,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:18:38,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:18:38,695 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2025-03-04 01:18:38,696 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 1 case distinctions, treesize of input 27 treesize of output 26 [2025-03-04 01:18:38,794 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2025-03-04 01:18:38,795 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 1 case distinctions, treesize of input 22 treesize of output 21 [2025-03-04 01:18:38,882 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:18:38,883 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 26 treesize of output 14 [2025-03-04 01:18:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 121 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-04 01:18:38,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:18:39,314 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2025-03-04 01:18:39,315 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 23 treesize of output 22 [2025-03-04 01:18:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 01:18:39,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:18:39,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850381562] [2025-03-04 01:18:39,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850381562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:18:39,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:18:39,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2025-03-04 01:18:39,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631852341] [2025-03-04 01:18:39,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:18:39,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 01:18:39,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:18:39,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 01:18:39,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:18:39,415 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 30 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 6 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22)