./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-p_file-19.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 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:43:05,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:43:05,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:43:05,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:43:05,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:43:05,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:43:05,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:43:05,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:43:05,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:43:05,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:43:05,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:43:05,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:43:05,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:43:05,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:43:05,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:43:05,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:05,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:43:05,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:43:05,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:43:05,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:43:05,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:43:05,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:43:05,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:43:05,650 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 -> 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 [2025-03-17 05:43:05,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:43:05,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:43:05,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:43:05,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:43:05,924 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:43:05,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:07,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451996fd0/79753b5a09304fd8988be973dbf20b60/FLAG2c062e0e0 [2025-03-17 05:43:07,374 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:43:07,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:07,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451996fd0/79753b5a09304fd8988be973dbf20b60/FLAG2c062e0e0 [2025-03-17 05:43:07,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451996fd0/79753b5a09304fd8988be973dbf20b60 [2025-03-17 05:43:07,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:43:07,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:43:07,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:07,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:43:07,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:43:07,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07, skipping insertion in model container [2025-03-17 05:43:07,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:43:07,605 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-p_file-19.i[916,929] [2025-03-17 05:43:07,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:07,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:43:07,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i[916,929] [2025-03-17 05:43:07,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:07,738 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:43:07,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07 WrapperNode [2025-03-17 05:43:07,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:07,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:07,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:43:07,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:43:07,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,797 INFO L138 Inliner]: procedures = 26, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2025-03-17 05:43:07,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:07,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:43:07,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:43:07,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:43:07,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,845 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 5, 16, 10, 10, 8, 14, 24, 8, 7, 8, 7, 5]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1]. [2025-03-17 05:43:07,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:43:07,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:43:07,882 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:43:07,882 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:43:07,883 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (1/1) ... [2025-03-17 05:43:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:07,917 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-17 05:43:07,924 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-17 05:43:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:43:07,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:43:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:43:07,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:43:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:43:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:43:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:43:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:43:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:43:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:43:07,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:43:08,078 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:43:08,080 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:43:08,500 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:43:08,549 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-17 05:43:08,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:43:08,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:43:08,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:43:08,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:08 BoogieIcfgContainer [2025-03-17 05:43:08,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:43:08,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:43:08,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:43:08,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:43:08,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:43:07" (1/3) ... [2025-03-17 05:43:08,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721bc3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:08, skipping insertion in model container [2025-03-17 05:43:08,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:07" (2/3) ... [2025-03-17 05:43:08,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721bc3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:08, skipping insertion in model container [2025-03-17 05:43:08,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:08" (3/3) ... [2025-03-17 05:43:08,575 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:08,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:43:08,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-19.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:43:08,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:43:08,650 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;@716b30e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:43:08,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:43:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:08,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:08,663 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:08,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:08,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -875866232, now seen corresponding path program 1 times [2025-03-17 05:43:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-03-17 05:43:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:08,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:08,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:08,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:08,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:43:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-03-17 05:43:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697783008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650259203] [2025-03-17 05:43:08,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:08,942 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-17 05:43:08,943 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-17 05:43:09,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:09,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:09,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:43:09,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:43:09,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:09,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650259203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:09,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:43:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007299962] [2025-03-17 05:43:09,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:43:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:09,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:43:09,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:09,190 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:43:09,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:09,216 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2025-03-17 05:43:09,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:43:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 128 [2025-03-17 05:43:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:09,226 INFO L225 Difference]: With dead ends: 189 [2025-03-17 05:43:09,226 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:43:09,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-17 05:43:09,233 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:09,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:43:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 05:43:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-17 05:43:09,266 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 128 [2025-03-17 05:43:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-17 05:43:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:43:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-17 05:43:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:09,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:09,270 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:09,277 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-17 05:43:09,471 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-17 05:43:09,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1198351657, now seen corresponding path program 1 times [2025-03-17 05:43:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982319569] [2025-03-17 05:43:09,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:09,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:09,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:09,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:09,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:09,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982319569] [2025-03-17 05:43:09,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982319569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:09,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:09,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:43:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616248] [2025-03-17 05:43:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:09,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:43:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:09,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:43:09,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:43:09,806 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:09,855 INFO L93 Difference]: Finished difference Result 190 states and 273 transitions. [2025-03-17 05:43:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:43:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:43:09,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:09,858 INFO L225 Difference]: With dead ends: 190 [2025-03-17 05:43:09,859 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:43:09,859 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-17 05:43:09,861 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:43:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 05:43:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2025-03-17 05:43:09,873 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 128 [2025-03-17 05:43:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:09,874 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2025-03-17 05:43:09,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2025-03-17 05:43:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:09,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:09,876 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:43:09,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:09,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1197428136, now seen corresponding path program 1 times [2025-03-17 05:43:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090202690] [2025-03-17 05:43:09,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:09,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:10,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:10,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:10,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-17 05:43:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090202690] [2025-03-17 05:43:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090202690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997648504] [2025-03-17 05:43:14,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:14,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:14,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:14,997 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-17 05:43:14,999 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-17 05:43:15,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:15,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:15,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:15,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:15,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:43:15,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:15,393 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-17 05:43:15,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2025-03-17 05:43:15,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 05:43:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2025-03-17 05:43:15,568 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 195 treesize of output 171 [2025-03-17 05:43:15,575 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 171 treesize of output 115 [2025-03-17 05:43:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 295 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-03-17 05:43:15,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:15,760 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 53 treesize of output 49 [2025-03-17 05:43:15,772 INFO L349 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2025-03-17 05:43:15,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 1 [2025-03-17 05:43:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997648504] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:43:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 9] total 20 [2025-03-17 05:43:15,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872568131] [2025-03-17 05:43:15,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:15,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:15,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:15,843 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:15,999 INFO L93 Difference]: Finished difference Result 251 states and 354 transitions. [2025-03-17 05:43:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:43:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:16,002 INFO L225 Difference]: With dead ends: 251 [2025-03-17 05:43:16,003 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 05:43:16,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:43:16,006 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 69 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:16,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 773 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 05:43:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-03-17 05:43:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 128 states have internal predecessors, (168), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:43:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 214 transitions. [2025-03-17 05:43:16,028 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 214 transitions. Word has length 128 [2025-03-17 05:43:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:16,029 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 214 transitions. [2025-03-17 05:43:16,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 214 transitions. [2025-03-17 05:43:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:16,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:16,033 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:16,042 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-17 05:43:16,238 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,SelfDestructingSolverStorable2 [2025-03-17 05:43:16,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash 155881561, now seen corresponding path program 1 times [2025-03-17 05:43:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328993875] [2025-03-17 05:43:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:16,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:16,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:16,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328993875] [2025-03-17 05:43:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328993875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:43:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814967973] [2025-03-17 05:43:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:16,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:43:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:16,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:43:16,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:43:16,409 INFO L87 Difference]: Start difference. First operand 153 states and 214 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:16,520 INFO L93 Difference]: Finished difference Result 374 states and 521 transitions. [2025-03-17 05:43:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:43:16,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:43:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:16,524 INFO L225 Difference]: With dead ends: 374 [2025-03-17 05:43:16,524 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 05:43:16,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:16,528 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 85 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:16,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 726 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 05:43:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-03-17 05:43:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 182 states have internal predecessors, (235), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:43:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 305 transitions. [2025-03-17 05:43:16,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 305 transitions. Word has length 128 [2025-03-17 05:43:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 305 transitions. [2025-03-17 05:43:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 305 transitions. [2025-03-17 05:43:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:43:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:16,558 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:43:16,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2135302932, now seen corresponding path program 1 times [2025-03-17 05:43:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455833306] [2025-03-17 05:43:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:16,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:16,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:43:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:43:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455833306] [2025-03-17 05:43:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455833306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:43:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106939786] [2025-03-17 05:43:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:43:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:43:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:43:17,126 INFO L87 Difference]: Start difference. First operand 219 states and 305 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:43:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:17,636 INFO L93 Difference]: Finished difference Result 506 states and 700 transitions. [2025-03-17 05:43:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:43:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 129 [2025-03-17 05:43:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:17,639 INFO L225 Difference]: With dead ends: 506 [2025-03-17 05:43:17,639 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 05:43:17,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:17,641 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 322 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:17,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 904 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:43:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 05:43:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2025-03-17 05:43:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 194 states have internal predecessors, (251), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:43:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 321 transitions. [2025-03-17 05:43:17,669 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 321 transitions. Word has length 129 [2025-03-17 05:43:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:17,669 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 321 transitions. [2025-03-17 05:43:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:43:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 321 transitions. [2025-03-17 05:43:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:43:17,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:17,671 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:43:17,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -542085545, now seen corresponding path program 1 times [2025-03-17 05:43:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602560274] [2025-03-17 05:43:17,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:17,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:43:17,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:43:17,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:17,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602560274] [2025-03-17 05:43:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602560274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:18,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:43:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288011468] [2025-03-17 05:43:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:18,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:43:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:18,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:43:18,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:18,312 INFO L87 Difference]: Start difference. First operand 231 states and 321 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:43:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:19,132 INFO L93 Difference]: Finished difference Result 569 states and 787 transitions. [2025-03-17 05:43:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:43:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 130 [2025-03-17 05:43:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:19,139 INFO L225 Difference]: With dead ends: 569 [2025-03-17 05:43:19,139 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 05:43:19,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:43:19,143 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 396 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:19,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1184 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:43:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 05:43:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 252. [2025-03-17 05:43:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 213 states have (on average 1.3098591549295775) internal successors, (279), 215 states have internal predecessors, (279), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:43:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 349 transitions. [2025-03-17 05:43:19,174 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 349 transitions. Word has length 130 [2025-03-17 05:43:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:19,175 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 349 transitions. [2025-03-17 05:43:19,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:43:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 349 transitions. [2025-03-17 05:43:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:43:19,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:19,177 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:19,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:43:19,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:19,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2010191355, now seen corresponding path program 1 times [2025-03-17 05:43:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809496502] [2025-03-17 05:43:19,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:19,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:43:19,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:43:19,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:19,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:20,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809496502] [2025-03-17 05:43:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809496502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:43:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599477886] [2025-03-17 05:43:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:20,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:43:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:20,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:43:20,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:43:20,049 INFO L87 Difference]: Start difference. First operand 252 states and 349 transitions. Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:43:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:20,803 INFO L93 Difference]: Finished difference Result 600 states and 828 transitions. [2025-03-17 05:43:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:43:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 130 [2025-03-17 05:43:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:20,806 INFO L225 Difference]: With dead ends: 600 [2025-03-17 05:43:20,807 INFO L226 Difference]: Without dead ends: 349 [2025-03-17 05:43:20,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:20,808 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 486 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:20,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 963 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:43:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-17 05:43:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 248. [2025-03-17 05:43:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 211 states have internal predecessors, (272), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:43:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 342 transitions. [2025-03-17 05:43:20,837 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 342 transitions. Word has length 130 [2025-03-17 05:43:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:20,837 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 342 transitions. [2025-03-17 05:43:20,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:43:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 342 transitions. [2025-03-17 05:43:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:20,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:20,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:20,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:43:20,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:20,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1000448205, now seen corresponding path program 1 times [2025-03-17 05:43:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034153575] [2025-03-17 05:43:20,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:20,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:20,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034153575] [2025-03-17 05:43:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034153575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:43:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925121505] [2025-03-17 05:43:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:20,990 INFO L87 Difference]: Start difference. First operand 248 states and 342 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:21,156 INFO L93 Difference]: Finished difference Result 573 states and 788 transitions. [2025-03-17 05:43:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:43:21,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:43:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:21,158 INFO L225 Difference]: With dead ends: 573 [2025-03-17 05:43:21,158 INFO L226 Difference]: Without dead ends: 326 [2025-03-17 05:43:21,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:21,159 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 83 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:21,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 716 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-17 05:43:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 323. [2025-03-17 05:43:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 273 states have (on average 1.2967032967032968) internal successors, (354), 276 states have internal predecessors, (354), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:43:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 444 transitions. [2025-03-17 05:43:21,187 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 444 transitions. Word has length 131 [2025-03-17 05:43:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:21,187 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 444 transitions. [2025-03-17 05:43:21,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 444 transitions. [2025-03-17 05:43:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:21,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:21,189 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:43:21,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1293851212, now seen corresponding path program 1 times [2025-03-17 05:43:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501556611] [2025-03-17 05:43:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:21,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:21,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:21,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:43:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501556611] [2025-03-17 05:43:21,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501556611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:21,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482945774] [2025-03-17 05:43:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:21,519 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-17 05:43:21,521 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-17 05:43:21,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:21,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:21,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:43:21,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:21,860 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-17 05:43:21,953 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 15 treesize of output 7 [2025-03-17 05:43:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-17 05:43:21,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:22,099 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 32 treesize of output 28 [2025-03-17 05:43:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:43:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482945774] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:43:22,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:43:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2025-03-17 05:43:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821926447] [2025-03-17 05:43:22,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:43:22,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:43:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:43:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:22,197 INFO L87 Difference]: Start difference. First operand 323 states and 444 transitions. Second operand has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-17 05:43:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:22,626 INFO L93 Difference]: Finished difference Result 584 states and 797 transitions. [2025-03-17 05:43:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:43:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 131 [2025-03-17 05:43:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:22,628 INFO L225 Difference]: With dead ends: 584 [2025-03-17 05:43:22,629 INFO L226 Difference]: Without dead ends: 262 [2025-03-17 05:43:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:43:22,631 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 267 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:22,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 539 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-17 05:43:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2025-03-17 05:43:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 215 states have (on average 1.283720930232558) internal successors, (276), 217 states have internal predecessors, (276), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:43:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 346 transitions. [2025-03-17 05:43:22,654 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 346 transitions. Word has length 131 [2025-03-17 05:43:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 346 transitions. [2025-03-17 05:43:22,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-17 05:43:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2025-03-17 05:43:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:22,656 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:22,663 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-17 05:43:22,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:22,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash 591623980, now seen corresponding path program 1 times [2025-03-17 05:43:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457433378] [2025-03-17 05:43:22,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:22,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:22,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:22,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:22,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:22,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:43:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457433378] [2025-03-17 05:43:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457433378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732473965] [2025-03-17 05:43:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:23,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:23,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:23,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:43:23,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:23,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:23,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:23,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:23,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:43:23,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:23,692 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-17 05:43:23,713 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-17 05:43:23,776 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 57 treesize of output 45 [2025-03-17 05:43:23,820 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 49 treesize of output 29 [2025-03-17 05:43:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:43:23,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732473965] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:43:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 9] total 21 [2025-03-17 05:43:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830778877] [2025-03-17 05:43:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:43:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:24,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:43:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:43:24,044 INFO L87 Difference]: Start difference. First operand 256 states and 346 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:24,285 INFO L93 Difference]: Finished difference Result 574 states and 772 transitions. [2025-03-17 05:43:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:43:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:43:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:24,288 INFO L225 Difference]: With dead ends: 574 [2025-03-17 05:43:24,288 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 05:43:24,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:43:24,291 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 71 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:24,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1027 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 05:43:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 314. [2025-03-17 05:43:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 271 states have internal predecessors, (344), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:43:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 422 transitions. [2025-03-17 05:43:24,322 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 422 transitions. Word has length 131 [2025-03-17 05:43:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:24,323 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 422 transitions. [2025-03-17 05:43:24,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 422 transitions. [2025-03-17 05:43:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:24,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:24,327 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:24,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:43:24,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:24,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:24,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1651345354, now seen corresponding path program 1 times [2025-03-17 05:43:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180045133] [2025-03-17 05:43:24,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:24,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:24,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:24,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:24,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180045133] [2025-03-17 05:43:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180045133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:24,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:43:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2859185] [2025-03-17 05:43:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:24,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:24,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:24,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:24,829 INFO L87 Difference]: Start difference. First operand 314 states and 422 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:25,005 INFO L93 Difference]: Finished difference Result 744 states and 1000 transitions. [2025-03-17 05:43:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:43:25,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:43:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:25,008 INFO L225 Difference]: With dead ends: 744 [2025-03-17 05:43:25,008 INFO L226 Difference]: Without dead ends: 426 [2025-03-17 05:43:25,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:25,009 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 55 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:25,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 602 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-17 05:43:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 307. [2025-03-17 05:43:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 261 states have (on average 1.2681992337164751) internal successors, (331), 264 states have internal predecessors, (331), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 05:43:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 409 transitions. [2025-03-17 05:43:25,032 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 409 transitions. Word has length 131 [2025-03-17 05:43:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:25,032 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 409 transitions. [2025-03-17 05:43:25,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 409 transitions. [2025-03-17 05:43:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:25,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:25,034 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:25,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:43:25,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1999048159, now seen corresponding path program 1 times [2025-03-17 05:43:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551151035] [2025-03-17 05:43:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:25,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:25,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:25,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:25,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:43:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250441902] [2025-03-17 05:43:25,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:25,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:25,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:25,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:25,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:43:25,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:27,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:27,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:27,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:27,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-03-17 05:43:27,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:27,447 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-17 05:43:28,373 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-17 05:43:29,120 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-17 05:43:29,782 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-17 05:43:30,028 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 7 treesize of output 3 [2025-03-17 05:43:30,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 05:43:30,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 05:43:31,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2025-03-17 05:43:32,345 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 25 treesize of output 19 [2025-03-17 05:43:32,416 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 24 treesize of output 16 [2025-03-17 05:43:32,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:43:32,595 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 34 [2025-03-17 05:43:32,647 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 05:43:32,648 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 23 treesize of output 19 [2025-03-17 05:43:33,313 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 40 [2025-03-17 05:43:33,321 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 44 treesize of output 28 [2025-03-17 05:43:33,831 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 32 treesize of output 20 [2025-03-17 05:43:34,313 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 47 treesize of output 27 [2025-03-17 05:43:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 16 proven. 518 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 05:43:34,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:36,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:36,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551151035] [2025-03-17 05:43:36,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:43:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250441902] [2025-03-17 05:43:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250441902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:36,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2025-03-17 05:43:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069704687] [2025-03-17 05:43:36,775 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 05:43:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 05:43:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:36,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 05:43:36,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2025-03-17 05:43:36,778 INFO L87 Difference]: Start difference. First operand 307 states and 409 transitions. Second operand has 47 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (17), 9 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 05:43:48,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 05:43:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:50,333 INFO L93 Difference]: Finished difference Result 1414 states and 1866 transitions. [2025-03-17 05:43:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-17 05:43:50,333 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (17), 9 states have call predecessors, (17), 13 states have call successors, (17) Word has length 131 [2025-03-17 05:43:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:50,338 INFO L225 Difference]: With dead ends: 1414 [2025-03-17 05:43:50,338 INFO L226 Difference]: Without dead ends: 1108 [2025-03-17 05:43:50,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3040 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1101, Invalid=9819, Unknown=0, NotChecked=0, Total=10920 [2025-03-17 05:43:50,344 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 519 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:50,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 2420 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-17 05:43:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-17 05:43:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 421. [2025-03-17 05:43:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 349 states have (on average 1.2464183381088825) internal successors, (435), 352 states have internal predecessors, (435), 56 states have call successors, (56), 15 states have call predecessors, (56), 15 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:43:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 547 transitions. [2025-03-17 05:43:50,382 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 547 transitions. Word has length 131 [2025-03-17 05:43:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:50,383 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 547 transitions. [2025-03-17 05:43:50,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 41 states have internal predecessors, (91), 13 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (17), 9 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 05:43:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 547 transitions. [2025-03-17 05:43:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:50,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:50,386 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:50,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:43:50,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 05:43:50,587 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:50,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2002516130, now seen corresponding path program 1 times [2025-03-17 05:43:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820760713] [2025-03-17 05:43:50,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:50,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:50,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:50,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:50,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:43:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820760713] [2025-03-17 05:43:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820760713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119575955] [2025-03-17 05:43:50,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:50,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:50,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:50,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:43:50,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:50,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:50,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:50,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:51,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:43:51,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:51,128 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-17 05:43:51,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 15 treesize of output 7 [2025-03-17 05:43:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-17 05:43:51,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:51,291 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 32 treesize of output 28 [2025-03-17 05:43:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:43:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119575955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:43:51,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:43:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2025-03-17 05:43:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895090705] [2025-03-17 05:43:51,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:43:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:43:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:51,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:43:51,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:51,361 INFO L87 Difference]: Start difference. First operand 421 states and 547 transitions. Second operand has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-17 05:43:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:51,647 INFO L93 Difference]: Finished difference Result 743 states and 971 transitions. [2025-03-17 05:43:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:43:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) Word has length 131 [2025-03-17 05:43:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:51,649 INFO L225 Difference]: With dead ends: 743 [2025-03-17 05:43:51,649 INFO L226 Difference]: Without dead ends: 437 [2025-03-17 05:43:51,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:43:51,654 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 331 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 540 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-17 05:43:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 421. [2025-03-17 05:43:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 349 states have (on average 1.2234957020057307) internal successors, (427), 352 states have internal predecessors, (427), 56 states have call successors, (56), 15 states have call predecessors, (56), 15 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:43:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 539 transitions. [2025-03-17 05:43:51,682 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 539 transitions. Word has length 131 [2025-03-17 05:43:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 539 transitions. [2025-03-17 05:43:51,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 3 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-17 05:43:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 539 transitions. [2025-03-17 05:43:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:43:51,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:51,684 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:51,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:43:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:51,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2030067966, now seen corresponding path program 1 times [2025-03-17 05:43:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113677334] [2025-03-17 05:43:51,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:51,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:51,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:51,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:51,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:43:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639127998] [2025-03-17 05:43:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:51,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:51,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:51,927 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:51,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:43:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:52,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:52,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:52,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:43:52,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:43:52,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:43:52,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:43:52,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:52,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:43:52,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:43:52,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:43:52,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:43:52,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:43:52,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:52,794 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:52,932 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:43:52,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:43:52 BoogieIcfgContainer [2025-03-17 05:43:52,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:43:52,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:43:52,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:43:52,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:43:52,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:08" (3/4) ... [2025-03-17 05:43:52,938 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:43:52,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:43:52,939 INFO L158 Benchmark]: Toolchain (without parser) took 45485.10ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 114.0MB in the beginning and 82.8MB in the end (delta: 31.2MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-03-17 05:43:52,940 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:43:52,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.99ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:43:52,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.44ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:43:52,940 INFO L158 Benchmark]: Boogie Preprocessor took 77.81ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:43:52,941 INFO L158 Benchmark]: IcfgBuilder took 686.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 58.1MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:43:52,941 INFO L158 Benchmark]: TraceAbstraction took 44366.37ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 57.2MB in the beginning and 83.0MB in the end (delta: -25.8MB). Peak memory consumption was 297.7MB. Max. memory is 16.1GB. [2025-03-17 05:43:52,941 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 135.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:43:52,943 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.99ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 99.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.44ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.81ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 686.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 58.1MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44366.37ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 57.2MB in the beginning and 83.0MB in the end (delta: -25.8MB). Peak memory consumption was 297.7MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 82.8MB in the end (delta: 135.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69, overapproximation of shiftLeft at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 8; [L22] signed char var_1_1 = 8; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 128; [L24] unsigned char var_1_2 = 128; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 64; [L26] unsigned char var_1_3 = 64; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] unsigned long int var_1_4 = 1; [L28] unsigned long int var_1_4 = 1; [L29] unsigned long int* var_1_4_Pointer = &(var_1_4); [L30] unsigned long int var_1_5 = 5; [L30] unsigned long int var_1_5 = 5; [L31] unsigned long int* var_1_5_Pointer = &(var_1_5); [L32] signed char var_1_7 = 4; [L32] signed char var_1_7 = 4; [L33] signed char* var_1_7_Pointer = &(var_1_7); [L34] signed char var_1_8 = 100; [L34] signed char var_1_8 = 100; [L35] signed char* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_9 = 1; [L36] unsigned char var_1_9 = 1; [L37] unsigned char* var_1_9_Pointer = &(var_1_9); [L38] signed long int var_1_10 = -8; [L38] signed long int var_1_10 = -8; [L39] signed long int* var_1_10_Pointer = &(var_1_10); [L40] signed long int var_1_11 = 10; [L40] signed long int var_1_11 = 10; [L41] signed long int* var_1_11_Pointer = &(var_1_11); [L42] signed long int var_1_12 = -25; [L42] signed long int var_1_12 = -25; [L43] signed long int* var_1_12_Pointer = &(var_1_12); [L44] signed long int var_1_13 = -16; [L44] signed long int var_1_13 = -16; [L45] signed long int* var_1_13_Pointer = &(var_1_13); [L46] signed long int last_1_var_1_11 = 10; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] EXPR \read(var_1_11) [L105] last_1_var_1_11 = var_1_11 [L115] RET updateLastVariables() [L116] CALL updateVariables() [L78] var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L79] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L79] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] var_1_3 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] var_1_4 = __VERIFIER_nondet_ulong() [L85] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_4 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_4 <= 12) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] var_1_5 = __VERIFIER_nondet_ulong() [L88] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not(var_1_5 <= 11) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not(var_1_5 <= 11) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] var_1_7 = __VERIFIER_nondet_char() [L91] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] var_1_8 = __VERIFIER_nondet_char() [L94] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] var_1_12 = __VERIFIER_nondet_long() [L100] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L116] RET updateVariables() [L117] CALL step() [L50] EXPR \read(*var_1_7_Pointer) [L50] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L50] COND TRUE (*(var_1_7_Pointer)) < (*(var_1_3_Pointer)) [L51] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L51] COND FALSE !(last_1_var_1_11 > (*(var_1_7_Pointer))) [L59] EXPR \read(*var_1_7_Pointer) [L59] (*(var_1_13_Pointer)) = (*(var_1_7_Pointer)) [L60] EXPR \read(*var_1_2_Pointer) [L60] EXPR \read(*var_1_12_Pointer) [L60] signed long int stepLocal_1 = (*(var_1_2_Pointer)) / (*(var_1_12_Pointer)); [L61] EXPR \read(*var_1_10_Pointer) [L61] EXPR \read(*var_1_13_Pointer) [L61] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L61] COND FALSE !((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > stepLocal_1) [L66] EXPR \read(*var_1_7_Pointer) [L66] (*(var_1_11_Pointer)) = (*(var_1_7_Pointer)) [L68] EXPR \read(*var_1_11_Pointer) [L68] signed long int stepLocal_0 = (*(var_1_11_Pointer)); [L69] EXPR \read(*var_1_2_Pointer) [L69] EXPR \read(*var_1_3_Pointer) [L69] EXPR \read(*var_1_4_Pointer) [L69] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L69] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))) VAL [isInitial=1, last_1_var_1_11=10, stepLocal_0=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L69] COND FALSE !((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= stepLocal_0) [L72] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L72] COND TRUE (*(var_1_9_Pointer)) [L73] EXPR \read(*var_1_5_Pointer) [L73] (*(var_1_1_Pointer)) = (*(var_1_5_Pointer)) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR \read(*var_1_2_Pointer) [L108] EXPR \read(*var_1_3_Pointer) [L108] EXPR \read(*var_1_4_Pointer) [L108] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1) [L108] EXPR \read(*var_1_1_Pointer) [L108] EXPR \read(*var_1_4_Pointer) [L108] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) [L108] EXPR \read(*var_1_8_Pointer) [L108] EXPR (((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))) [L108] EXPR \read(*var_1_4_Pointer) [L108] EXPR (((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1)) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1)) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1))) && (((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > ((*(var_1_2_Pointer)) / (*(var_1_12_Pointer)))) ? ((*(var_1_9_Pointer)) ? ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) : 1) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1))) && (((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > ((*(var_1_2_Pointer)) / (*(var_1_12_Pointer)))) ? ((*(var_1_9_Pointer)) ? ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) : 1) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_7_Pointer))))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1))) && (((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > ((*(var_1_2_Pointer)) / (*(var_1_12_Pointer)))) ? ((*(var_1_9_Pointer)) ? ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) : 1) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))))) && ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1))) && (((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > ((*(var_1_2_Pointer)) / (*(var_1_12_Pointer)))) ? ((*(var_1_9_Pointer)) ? ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) : 1) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))))) && ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108-L109] return (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) << ((*(var_1_4_Pointer)) + (*(var_1_5_Pointer)))) <= (*(var_1_11_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed char) (((((*(var_1_4_Pointer))) > ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer)))))))))) : ((*(var_1_9_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) : 1)) && (((*(var_1_7_Pointer)) < (*(var_1_3_Pointer))) ? ((last_1_var_1_11 > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((*(var_1_3_Pointer)) - (*(var_1_8_Pointer))))) : 1) : ((((*(var_1_8_Pointer)) + (((((*(var_1_2_Pointer))) < 0 ) ? -((*(var_1_2_Pointer))) : ((*(var_1_2_Pointer)))))) > (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) : 1))) && (((((*(var_1_10_Pointer)) * (*(var_1_13_Pointer))) + (*(var_1_8_Pointer))) > ((*(var_1_2_Pointer)) / (*(var_1_12_Pointer)))) ? ((*(var_1_9_Pointer)) ? ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) : 1) : ((*(var_1_11_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))))) && ((*(var_1_13_Pointer)) == ((signed long int) (*(var_1_7_Pointer)))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 158 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 14, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2686 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2685 mSDsluCounter, 10908 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9068 mSDsCounter, 465 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6624 IncrementalHoareTripleChecker+Invalid, 7089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 465 mSolverCounterUnsat, 1840 mSDtfsCounter, 6624 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 1284 SyntacticMatches, 3 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=12, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1084 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2729 NumberOfCodeBlocks, 2729 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2835 ConstructedInterpolants, 118 QuantifiedInterpolants, 19300 SizeOfPredicates, 101 NumberOfNonLiveVariables, 3139 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 10145/11968 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-17 05:43:53,063 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-p_file-19.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 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:43:54,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:43:54,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:43:54,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:43:54,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:43:54,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:43:54,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:43:54,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:43:54,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:43:54,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:43:54,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:43:54,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:43:54,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:43:54,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:43:54,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:43:54,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:43:54,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:43:54,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:43:54,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:43:54,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:43:54,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:43:54,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:43:54,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:43:54,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:54,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:43:54,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:43:54,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:43:54,977 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 -> 5e838264e6ed88ede0832d807d635f75755550116c48539e38a7650cef86d5a2 [2025-03-17 05:43:55,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:43:55,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:43:55,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:43:55,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:43:55,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:43:55,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:56,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94de676a/7407b37f10ec41a1a634afc251e57df9/FLAGcd5249b3c [2025-03-17 05:43:56,697 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:43:56,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:56,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94de676a/7407b37f10ec41a1a634afc251e57df9/FLAGcd5249b3c [2025-03-17 05:43:56,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94de676a/7407b37f10ec41a1a634afc251e57df9 [2025-03-17 05:43:56,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:43:56,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:43:56,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:56,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:43:56,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:43:56,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:56,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac2b6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56, skipping insertion in model container [2025-03-17 05:43:56,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:56,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:43:56,862 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-p_file-19.i[916,929] [2025-03-17 05:43:56,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:56,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:43:56,927 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-p_file-19.i[916,929] [2025-03-17 05:43:56,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:56,964 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:43:56,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56 WrapperNode [2025-03-17 05:43:56,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:56,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:56,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:43:56,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:43:56,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:56,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,012 INFO L138 Inliner]: procedures = 30, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2025-03-17 05:43:57,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:57,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:43:57,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:43:57,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:43:57,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,061 INFO L175 MemorySlicer]: Split 124 memory accesses to 13 slices as follows [2, 5, 16, 10, 10, 8, 14, 24, 8, 7, 8, 7, 5]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1]. [2025-03-17 05:43:57,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:43:57,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:43:57,106 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:43:57,106 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:43:57,107 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (1/1) ... [2025-03-17 05:43:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:57,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:57,136 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-17 05:43:57,143 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-17 05:43:57,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:43:57,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:43:57,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:43:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:43:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:43:57,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-17 05:43:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:43:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:43:57,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:43:57,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:43:57,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:43:57,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:43:57,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-17 05:43:57,331 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:43:57,332 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:43:57,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite90#1;havoc property_#t~mem85#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~ite84#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite107#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem102#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite120#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-03-17 05:43:57,871 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 05:43:57,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:43:57,878 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:43:57,878 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:43:57,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:57 BoogieIcfgContainer [2025-03-17 05:43:57,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:43:57,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:43:57,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:43:57,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:43:57,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:43:56" (1/3) ... [2025-03-17 05:43:57,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f14b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:57, skipping insertion in model container [2025-03-17 05:43:57,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:56" (2/3) ... [2025-03-17 05:43:57,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f14b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:57, skipping insertion in model container [2025-03-17 05:43:57,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:57" (3/3) ... [2025-03-17 05:43:57,889 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-19.i [2025-03-17 05:43:57,900 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:43:57,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-19.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:43:57,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:43:57,950 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;@5d3252b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:43:57,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:43:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:57,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:57,962 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:57,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1384851202, now seen corresponding path program 1 times [2025-03-17 05:43:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:57,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2101669025] [2025-03-17 05:43:57,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:57,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:57,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:57,980 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-17 05:43:57,981 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-17 05:43:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:58,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:43:58,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:43:58,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:58,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101669025] [2025-03-17 05:43:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101669025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:58,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:43:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321063935] [2025-03-17 05:43:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:58,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:43:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:58,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:43:58,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:58,230 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:43:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:58,246 INFO L93 Difference]: Finished difference Result 179 states and 283 transitions. [2025-03-17 05:43:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:43:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 125 [2025-03-17 05:43:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:58,252 INFO L225 Difference]: With dead ends: 179 [2025-03-17 05:43:58,252 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 05:43:58,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-17 05:43:58,256 INFO L435 NwaCegarLoop]: 128 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, 128 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-17 05:43:58,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 05:43:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 05:43:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2025-03-17 05:43:58,288 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 125 [2025-03-17 05:43:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:58,288 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2025-03-17 05:43:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:43:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2025-03-17 05:43:58,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:58,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:58,290 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:58,299 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-17 05:43:58,491 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 [2025-03-17 05:43:58,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:58,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1944044013, now seen corresponding path program 1 times [2025-03-17 05:43:58,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:58,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438571700] [2025-03-17 05:43:58,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:58,495 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-17 05:43:58,512 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-17 05:43:58,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:58,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:58,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:58,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:58,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:43:58,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:43:58,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:58,760 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438571700] [2025-03-17 05:43:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438571700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:43:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622921797] [2025-03-17 05:43:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:58,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:43:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:58,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:43:58,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:43:58,764 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:58,832 INFO L93 Difference]: Finished difference Result 180 states and 259 transitions. [2025-03-17 05:43:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:43:58,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-17 05:43:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:58,837 INFO L225 Difference]: With dead ends: 180 [2025-03-17 05:43:58,837 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:43:58,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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-17 05:43:58,838 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:58,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 366 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:43:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 05:43:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:43:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2025-03-17 05:43:58,855 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 125 [2025-03-17 05:43:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:58,856 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2025-03-17 05:43:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:43:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2025-03-17 05:43:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:58,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:58,861 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:58,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:43:59,062 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 [2025-03-17 05:43:59,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:59,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1943120492, now seen corresponding path program 1 times [2025-03-17 05:43:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:59,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664471882] [2025-03-17 05:43:59,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:59,065 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-17 05:43:59,066 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-17 05:43:59,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:59,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:59,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:43:59,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:59,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:43:59,862 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 54 treesize of output 42 [2025-03-17 05:43:59,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 52 treesize of output 32 [2025-03-17 05:43:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 21 proven. 313 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-17 05:43:59,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:44:00,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664471882] [2025-03-17 05:44:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664471882] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2025-03-17 05:44:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140103394] [2025-03-17 05:44:00,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:44:00,062 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:00,207 INFO L93 Difference]: Finished difference Result 238 states and 336 transitions. [2025-03-17 05:44:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:44:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-17 05:44:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:00,209 INFO L225 Difference]: With dead ends: 238 [2025-03-17 05:44:00,209 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 05:44:00,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:44:00,210 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:00,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 748 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 05:44:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2025-03-17 05:44:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.319327731092437) internal successors, (157), 120 states have internal predecessors, (157), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 05:44:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2025-03-17 05:44:00,230 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 125 [2025-03-17 05:44:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2025-03-17 05:44:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2025-03-17 05:44:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:44:00,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:00,232 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:44:00,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:44:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:00,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -435568683, now seen corresponding path program 1 times [2025-03-17 05:44:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040081599] [2025-03-17 05:44:00,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:00,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:00,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:44:00,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:44:00,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:44:00,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:00,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:00,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:44:00,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:44:00,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:00,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:00,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040081599] [2025-03-17 05:44:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040081599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:00,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515280730] [2025-03-17 05:44:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:00,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:00,622 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:00,839 INFO L93 Difference]: Finished difference Result 355 states and 495 transitions. [2025-03-17 05:44:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2025-03-17 05:44:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:00,842 INFO L225 Difference]: With dead ends: 355 [2025-03-17 05:44:00,843 INFO L226 Difference]: Without dead ends: 211 [2025-03-17 05:44:00,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:00,844 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 83 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:00,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 697 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:44:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-17 05:44:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2025-03-17 05:44:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 169 states have (on average 1.301775147928994) internal successors, (220), 171 states have internal predecessors, (220), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:44:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 290 transitions. [2025-03-17 05:44:00,855 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 290 transitions. Word has length 125 [2025-03-17 05:44:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:00,856 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 290 transitions. [2025-03-17 05:44:00,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 290 transitions. [2025-03-17 05:44:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:44:00,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:00,857 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:44:00,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:44:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:01,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash 518037808, now seen corresponding path program 1 times [2025-03-17 05:44:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243660678] [2025-03-17 05:44:01,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:01,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:01,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:44:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:44:01,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:44:01,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:01,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:01,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 05:44:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:07,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-17 05:44:07,126 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2025-03-17 05:44:07,127 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 21 treesize of output 28 [2025-03-17 05:44:07,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:44:08,010 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 64 treesize of output 48 [2025-03-17 05:44:08,028 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 59 treesize of output 43 [2025-03-17 05:44:08,049 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 33 [2025-03-17 05:44:08,058 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 40 treesize of output 28 [2025-03-17 05:44:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 441 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 05:44:08,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:44:09,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243660678] [2025-03-17 05:44:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243660678] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [37] total 46 [2025-03-17 05:44:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880043949] [2025-03-17 05:44:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:09,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:44:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:09,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:44:09,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1930, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 05:44:09,758 INFO L87 Difference]: Start difference. First operand 208 states and 290 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:11,972 INFO L93 Difference]: Finished difference Result 442 states and 612 transitions. [2025-03-17 05:44:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:44:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-17 05:44:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:11,977 INFO L225 Difference]: With dead ends: 442 [2025-03-17 05:44:11,977 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 05:44:11,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=192, Invalid=2460, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 05:44:11,979 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 246 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:11,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 946 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:44:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 05:44:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 209. [2025-03-17 05:44:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 170 states have (on average 1.3) internal successors, (221), 172 states have internal predecessors, (221), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:44:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 291 transitions. [2025-03-17 05:44:12,000 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 291 transitions. Word has length 126 [2025-03-17 05:44:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:12,000 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 291 transitions. [2025-03-17 05:44:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 291 transitions. [2025-03-17 05:44:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 05:44:12,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:12,002 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:44:12,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:44:12,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:12,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 7503631, now seen corresponding path program 1 times [2025-03-17 05:44:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358701048] [2025-03-17 05:44:12,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:12,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:12,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:44:12,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 05:44:12,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 05:44:12,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:12,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:12,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-17 05:44:12,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:17,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-17 05:44:17,515 INFO L349 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2025-03-17 05:44:17,515 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 21 treesize of output 28 [2025-03-17 05:44:18,139 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 64 treesize of output 48 [2025-03-17 05:44:18,148 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 34 [2025-03-17 05:44:18,157 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 33 [2025-03-17 05:44:18,163 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 40 treesize of output 28 [2025-03-17 05:44:18,383 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 444 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 05:44:18,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:44:19,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358701048] [2025-03-17 05:44:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358701048] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [34] total 39 [2025-03-17 05:44:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597234903] [2025-03-17 05:44:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:19,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:19,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:19,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:19,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:44:19,178 INFO L87 Difference]: Start difference. First operand 209 states and 291 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:19,972 INFO L93 Difference]: Finished difference Result 457 states and 634 transitions. [2025-03-17 05:44:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-03-17 05:44:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:19,975 INFO L225 Difference]: With dead ends: 457 [2025-03-17 05:44:19,975 INFO L226 Difference]: Without dead ends: 249 [2025-03-17 05:44:19,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=122, Invalid=1518, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:44:19,976 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 93 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:19,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 586 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:44:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-17 05:44:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 208. [2025-03-17 05:44:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 171 states have internal predecessors, (218), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:44:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2025-03-17 05:44:19,986 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 126 [2025-03-17 05:44:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:19,987 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2025-03-17 05:44:19,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:44:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2025-03-17 05:44:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:44:19,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:19,988 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:44:19,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 05:44:20,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:20,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash 627631795, now seen corresponding path program 1 times [2025-03-17 05:44:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:20,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87098864] [2025-03-17 05:44:20,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:20,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:20,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:20,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:44:20,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:44:20,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:44:20,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:20,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:20,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:44:20,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:20,596 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 18 treesize of output 10 [2025-03-17 05:44:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-17 05:44:20,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:20,799 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:44:20,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-03-17 05:44:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:44:20,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87098864] [2025-03-17 05:44:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87098864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:44:20,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:44:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-17 05:44:20,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144536592] [2025-03-17 05:44:20,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:44:20,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:44:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:20,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:44:20,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:44:20,886 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:44:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:21,553 INFO L93 Difference]: Finished difference Result 429 states and 587 transitions. [2025-03-17 05:44:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:44:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) Word has length 127 [2025-03-17 05:44:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:21,558 INFO L225 Difference]: With dead ends: 429 [2025-03-17 05:44:21,559 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 05:44:21,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:44:21,560 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 232 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:21,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 382 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:44:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 05:44:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 216. [2025-03-17 05:44:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 175 states have (on average 1.2742857142857142) internal successors, (223), 177 states have internal predecessors, (223), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-17 05:44:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 293 transitions. [2025-03-17 05:44:21,573 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 293 transitions. Word has length 127 [2025-03-17 05:44:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:21,573 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 293 transitions. [2025-03-17 05:44:21,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 2 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:44:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2025-03-17 05:44:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 05:44:21,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:21,577 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:44:21,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 05:44:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:21,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:21,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1980941492, now seen corresponding path program 1 times [2025-03-17 05:44:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633971070] [2025-03-17 05:44:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:21,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:44:21,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:44:21,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 05:44:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 05:44:22,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:22,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:22,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 05:44:22,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:24,285 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