./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:27:49,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:27:50,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:27:50,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:27:50,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:27:50,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:27:50,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:27:50,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:27:50,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:27:50,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:27:50,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:27:50,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:27:50,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:27:50,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:27:50,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:27:50,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:27:50,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:27:50,062 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2025-03-04 01:27:50,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:27:50,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:27:50,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:27:50,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:27:50,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:27:50,296 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-37.i [2025-03-04 01:27:51,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4133c6dc/25e3c6542e30436eb6d1bb522bbf2ac4/FLAG2c4624c01 [2025-03-04 01:27:51,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:27:51,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-03-04 01:27:51,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4133c6dc/25e3c6542e30436eb6d1bb522bbf2ac4/FLAG2c4624c01 [2025-03-04 01:27:51,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4133c6dc/25e3c6542e30436eb6d1bb522bbf2ac4 [2025-03-04 01:27:51,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:27:51,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:27:51,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:27:51,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:27:51,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:27:51,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c93915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51, skipping insertion in model container [2025-03-04 01:27:51,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:27:51,804 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-37.i[916,929] [2025-03-04 01:27:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:27:51,845 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:27:51,852 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-37.i[916,929] [2025-03-04 01:27:51,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:27:51,904 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:27:51,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51 WrapperNode [2025-03-04 01:27:51,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:27:51,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:27:51,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:27:51,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:27:51,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,957 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-04 01:27:51,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:27:51,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:27:51,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:27:51,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:27:51,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,990 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-03-04 01:27:51,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:51,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:27:52,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:27:52,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:27:52,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:27:52,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (1/1) ... [2025-03-04 01:27:52,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:27:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:27:52,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:27:52,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:27:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:27:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:27:52,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:27:52,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:27:52,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:27:52,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:27:52,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:27:52,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:27:52,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:27:52,212 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:27:52,214 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:27:52,611 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-04 01:27:52,645 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-04 01:27:52,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:27:52,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:27:52,661 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:27:52,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:27:52 BoogieIcfgContainer [2025-03-04 01:27:52,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:27:52,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:27:52,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:27:52,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:27:52,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:27:51" (1/3) ... [2025-03-04 01:27:52,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:27:52, skipping insertion in model container [2025-03-04 01:27:52,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:27:51" (2/3) ... [2025-03-04 01:27:52,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273b2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:27:52, skipping insertion in model container [2025-03-04 01:27:52,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:27:52" (3/3) ... [2025-03-04 01:27:52,669 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2025-03-04 01:27:52,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:27:52,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:27:52,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:27:52,728 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;@4fb2c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:27:52,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:27:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:52,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:52,758 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:52,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1525067906, now seen corresponding path program 1 times [2025-03-04 01:27:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:52,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821077188] [2025-03-04 01:27:52,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:52,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:52,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:52,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:27:53,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:53,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821077188] [2025-03-04 01:27:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821077188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:27:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466961976] [2025-03-04 01:27:53,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:27:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:27:53,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:27:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:27:53,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:53,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:53,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:53,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:53,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:27:53,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:27:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:27:53,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:27:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466961976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:53,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:27:53,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:27:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321605556] [2025-03-04 01:27:53,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:27:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:53,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:27:53,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:27:53,294 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:27:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:53,322 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-03-04 01:27:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:27:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-04 01:27:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:53,330 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:27:53,331 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:27:53,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:27:53,335 INFO L435 NwaCegarLoop]: 145 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, 145 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-04 01:27:53,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:27:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:27:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:27:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-03-04 01:27:53,359 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-03-04 01:27:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:53,360 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-03-04 01:27:53,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:27:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-03-04 01:27:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:53,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:53,363 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:53,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:27:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:27:53,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:53,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 362558503, now seen corresponding path program 1 times [2025-03-04 01:27:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548905069] [2025-03-04 01:27:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:53,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:53,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:53,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548905069] [2025-03-04 01:27:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548905069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:27:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818737272] [2025-03-04 01:27:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:53,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:27:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:53,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:27:53,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:53,855 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:27:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:53,892 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2025-03-04 01:27:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:27:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-03-04 01:27:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:53,894 INFO L225 Difference]: With dead ends: 201 [2025-03-04 01:27:53,894 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:27:53,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:53,895 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:53,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:27:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:27:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 01:27:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-03-04 01:27:53,909 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-03-04 01:27:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-03-04 01:27:53,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:27:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-03-04 01:27:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:53,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:53,911 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:27:53,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1608380954, now seen corresponding path program 1 times [2025-03-04 01:27:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704556470] [2025-03-04 01:27:53,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:53,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:53,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:53,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:53,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704556470] [2025-03-04 01:27:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704556470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:27:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655129950] [2025-03-04 01:27:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:54,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:27:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:27:54,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,089 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:54,121 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-03-04 01:27:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:27:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-04 01:27:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:54,126 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:27:54,126 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:27:54,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,127 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:54,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:27:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:27:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:27:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-03-04 01:27:54,140 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-03-04 01:27:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:54,141 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-03-04 01:27:54,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-03-04 01:27:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:54,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:54,144 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:54,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:27:54,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:54,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash 879131879, now seen corresponding path program 1 times [2025-03-04 01:27:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846804048] [2025-03-04 01:27:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:54,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:54,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:54,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846804048] [2025-03-04 01:27:54,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846804048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:54,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:54,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:27:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730350023] [2025-03-04 01:27:54,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:54,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:27:54,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:27:54,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,290 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:54,315 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-04 01:27:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:27:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-04 01:27:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:54,317 INFO L225 Difference]: With dead ends: 210 [2025-03-04 01:27:54,317 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:27:54,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,318 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:54,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:27:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:27:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-04 01:27:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-04 01:27:54,328 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-03-04 01:27:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:54,329 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-04 01:27:54,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-04 01:27:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:54,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:54,332 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:54,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:27:54,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1766635560, now seen corresponding path program 1 times [2025-03-04 01:27:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:54,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494340589] [2025-03-04 01:27:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:54,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:54,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:54,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:54,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:54,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:54,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494340589] [2025-03-04 01:27:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494340589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:54,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:27:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633163235] [2025-03-04 01:27:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:54,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:27:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:54,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:27:54,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,466 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:54,492 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2025-03-04 01:27:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:27:54,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-03-04 01:27:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:54,494 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:27:54,495 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:27:54,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:27:54,496 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:54,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:27:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:27:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:27:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:27:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-04 01:27:54,514 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 124 [2025-03-04 01:27:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:54,515 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-04 01:27:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-04 01:27:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:27:54,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:54,517 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:54,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:27:54,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1767559081, now seen corresponding path program 1 times [2025-03-04 01:27:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44678570] [2025-03-04 01:27:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:54,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:27:54,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:27:54,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:54,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44678570] [2025-03-04 01:27:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44678570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:27:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583222585] [2025-03-04 01:27:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:55,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:27:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:55,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:27:55,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:27:55,260 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:27:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:55,483 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2025-03-04 01:27:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:27:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 124 [2025-03-04 01:27:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:55,486 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:27:55,486 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:27:55,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:27:55,487 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 313 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:55,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 587 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:27:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:27:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:27:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:27:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2025-03-04 01:27:55,503 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 124 [2025-03-04 01:27:55,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:55,503 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2025-03-04 01:27:55,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:27:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2025-03-04 01:27:55,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:27:55,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:55,507 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:55,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:27:55,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1551241273, now seen corresponding path program 1 times [2025-03-04 01:27:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510022177] [2025-03-04 01:27:55,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:55,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:27:55,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:27:55,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:55,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:27:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510022177] [2025-03-04 01:27:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510022177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:27:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394800854] [2025-03-04 01:27:56,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:27:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:27:56,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:27:56,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:27:56,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:27:56,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:27:56,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:56,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:56,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:27:56,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:27:56,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:27:56,870 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-04 01:27:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:27:56,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:27:57,038 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-04 01:27:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:27:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394800854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:27:57,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:27:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2025-03-04 01:27:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738802153] [2025-03-04 01:27:57,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:27:57,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:27:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:57,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:27:57,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:27:57,122 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-04 01:27:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:57,932 INFO L93 Difference]: Finished difference Result 248 states and 337 transitions. [2025-03-04 01:27:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:27:57,932 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) Word has length 127 [2025-03-04 01:27:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:57,934 INFO L225 Difference]: With dead ends: 248 [2025-03-04 01:27:57,934 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:27:57,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:27:57,935 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 436 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:57,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 815 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:27:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:27:57,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2025-03-04 01:27:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.2844036697247707) internal successors, (140), 110 states have internal predecessors, (140), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:27:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2025-03-04 01:27:57,953 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 127 [2025-03-04 01:27:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:57,954 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2025-03-04 01:27:57,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) [2025-03-04 01:27:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2025-03-04 01:27:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:27:57,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:57,955 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:57,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:27:58,155 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,SelfDestructingSolverStorable6 [2025-03-04 01:27:58,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:58,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1296504728, now seen corresponding path program 1 times [2025-03-04 01:27:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113642353] [2025-03-04 01:27:58,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:27:58,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:27:58,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:58,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:27:58,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:58,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113642353] [2025-03-04 01:27:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113642353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:27:58,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:27:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:27:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134476719] [2025-03-04 01:27:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:58,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:27:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:27:58,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:27:58,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:27:58,289 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:58,376 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2025-03-04 01:27:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:27:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-04 01:27:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:58,378 INFO L225 Difference]: With dead ends: 291 [2025-03-04 01:27:58,378 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:27:58,378 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-04 01:27:58,379 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 128 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:58,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 596 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:27:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:27:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-04 01:27:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 134 states have internal predecessors, (166), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:27:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2025-03-04 01:27:58,397 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 127 [2025-03-04 01:27:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2025-03-04 01:27:58,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:27:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2025-03-04 01:27:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:27:58,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:58,399 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:27:58,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1490910759, now seen corresponding path program 1 times [2025-03-04 01:27:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:27:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289477422] [2025-03-04 01:27:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:27:58,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:27:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:27:58,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:58,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:27:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:27:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289477422] [2025-03-04 01:27:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289477422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:27:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607961965] [2025-03-04 01:27:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:27:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:27:59,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:27:59,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:27:59,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:27:59,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:27:59,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:59,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:59,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 01:27:59,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:27:59,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:27:59,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:27:59,981 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 23 treesize of output 15 [2025-03-04 01:27:59,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:00,015 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-04 01:28:00,047 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 19 treesize of output 11 [2025-03-04 01:28:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 231 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:28:00,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:00,258 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 36 [2025-03-04 01:28:00,532 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 39 treesize of output 35 [2025-03-04 01:28:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:28:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607961965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:28:00,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:28:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-03-04 01:28:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666333766] [2025-03-04 01:28:00,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:28:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 01:28:00,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:00,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 01:28:00,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:28:00,582 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) [2025-03-04 01:28:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:01,585 INFO L93 Difference]: Finished difference Result 307 states and 400 transitions. [2025-03-04 01:28:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:28:01,585 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) Word has length 127 [2025-03-04 01:28:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:01,586 INFO L225 Difference]: With dead ends: 307 [2025-03-04 01:28:01,586 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 01:28:01,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=379, Invalid=1783, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 01:28:01,588 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 606 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:01,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 878 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:28:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 01:28:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2025-03-04 01:28:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 118 states have internal predecessors, (146), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:28:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2025-03-04 01:28:01,598 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 127 [2025-03-04 01:28:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2025-03-04 01:28:01,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) [2025-03-04 01:28:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2025-03-04 01:28:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:28:01,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:01,600 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:01,608 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-04 01:28:01,804 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-04 01:28:01,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1459890952, now seen corresponding path program 1 times [2025-03-04 01:28:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667257844] [2025-03-04 01:28:01,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:28:01,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:28:01,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:01,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667257844] [2025-03-04 01:28:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667257844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:28:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405495858] [2025-03-04 01:28:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:28:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:02,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:28:02,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:28:02,279 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:28:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:02,682 INFO L93 Difference]: Finished difference Result 295 states and 387 transitions. [2025-03-04 01:28:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:28:02,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2025-03-04 01:28:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:02,683 INFO L225 Difference]: With dead ends: 295 [2025-03-04 01:28:02,683 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:28:02,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:28:02,684 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 542 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:02,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 721 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:28:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:28:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2025-03-04 01:28:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:28:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2025-03-04 01:28:02,701 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 127 [2025-03-04 01:28:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2025-03-04 01:28:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 01:28:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2025-03-04 01:28:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:28:02,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:02,702 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:28:02,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1965449577, now seen corresponding path program 1 times [2025-03-04 01:28:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553811533] [2025-03-04 01:28:02,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:02,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:28:02,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:28:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553811533] [2025-03-04 01:28:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553811533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:28:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659124907] [2025-03-04 01:28:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:02,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:02,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:28:02,918 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:02,985 INFO L93 Difference]: Finished difference Result 283 states and 363 transitions. [2025-03-04 01:28:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:02,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-03-04 01:28:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:02,987 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:28:02,987 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 01:28:02,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:02,987 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 99 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:02,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 700 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:02,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 01:28:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-03-04 01:28:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.216) internal successors, (152), 126 states have internal predecessors, (152), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:28:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2025-03-04 01:28:03,002 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 127 [2025-03-04 01:28:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:03,004 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2025-03-04 01:28:03,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2025-03-04 01:28:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:28:03,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:03,005 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:03,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:28:03,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:03,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash 834955122, now seen corresponding path program 1 times [2025-03-04 01:28:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037779446] [2025-03-04 01:28:03,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:03,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:28:03,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:28:03,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:03,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037779446] [2025-03-04 01:28:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037779446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:28:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526176741] [2025-03-04 01:28:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:04,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:28:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:04,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:28:04,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:28:04,022 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:28:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:04,656 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2025-03-04 01:28:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:28:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-03-04 01:28:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:04,658 INFO L225 Difference]: With dead ends: 235 [2025-03-04 01:28:04,659 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 01:28:04,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:28:04,660 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 448 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:04,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1044 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:28:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 01:28:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2025-03-04 01:28:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 173 states have (on average 1.1791907514450868) internal successors, (204), 175 states have internal predecessors, (204), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:28:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 284 transitions. [2025-03-04 01:28:04,682 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 284 transitions. Word has length 129 [2025-03-04 01:28:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 284 transitions. [2025-03-04 01:28:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:28:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 284 transitions. [2025-03-04 01:28:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:28:04,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:04,684 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:04,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:28:04,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash 835878643, now seen corresponding path program 1 times [2025-03-04 01:28:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839221592] [2025-03-04 01:28:04,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:04,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:28:04,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:28:04,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:04,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839221592] [2025-03-04 01:28:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839221592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:04,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:04,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:28:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655920997] [2025-03-04 01:28:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:28:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:04,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:28:04,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:28:04,834 INFO L87 Difference]: Start difference. First operand 229 states and 284 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:04,891 INFO L93 Difference]: Finished difference Result 442 states and 551 transitions. [2025-03-04 01:28:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:28:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:28:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:04,892 INFO L225 Difference]: With dead ends: 442 [2025-03-04 01:28:04,893 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 01:28:04,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:28:04,893 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 115 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:04,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 635 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 01:28:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 184. [2025-03-04 01:28:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:28:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2025-03-04 01:28:04,927 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 129 [2025-03-04 01:28:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:04,928 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2025-03-04 01:28:04,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2025-03-04 01:28:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:28:04,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:04,930 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:04,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:28:04,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:04,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1723382324, now seen corresponding path program 1 times [2025-03-04 01:28:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765944650] [2025-03-04 01:28:04,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:28:04,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:28:04,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:04,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765944650] [2025-03-04 01:28:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765944650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:28:05,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325406086] [2025-03-04 01:28:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:28:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:05,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:28:05,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:28:05,078 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:05,159 INFO L93 Difference]: Finished difference Result 311 states and 393 transitions. [2025-03-04 01:28:05,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:28:05,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:28:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:05,162 INFO L225 Difference]: With dead ends: 311 [2025-03-04 01:28:05,162 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 01:28:05,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:28:05,164 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:05,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 462 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:28:05,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 01:28:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-04 01:28:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 143 states have (on average 1.1958041958041958) internal successors, (171), 144 states have internal predecessors, (171), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:28:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2025-03-04 01:28:05,181 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 129 [2025-03-04 01:28:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:05,182 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2025-03-04 01:28:05,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2025-03-04 01:28:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:28:05,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:05,183 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:28:05,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash -84072139, now seen corresponding path program 1 times [2025-03-04 01:28:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569975139] [2025-03-04 01:28:05,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:05,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:28:05,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:28:05,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:05,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569975139] [2025-03-04 01:28:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569975139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:05,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:05,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:28:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004361318] [2025-03-04 01:28:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:05,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:05,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:05,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:28:05,617 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:05,789 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions. [2025-03-04 01:28:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:05,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:28:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:05,791 INFO L225 Difference]: With dead ends: 384 [2025-03-04 01:28:05,792 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 01:28:05,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:05,793 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 65 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:05,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 708 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:28:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 01:28:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 201. [2025-03-04 01:28:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.20625) internal successors, (193), 161 states have internal predecessors, (193), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:28:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 253 transitions. [2025-03-04 01:28:05,819 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 253 transitions. Word has length 129 [2025-03-04 01:28:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 253 transitions. [2025-03-04 01:28:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 253 transitions. [2025-03-04 01:28:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:28:05,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:05,821 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:28:05,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 62796034, now seen corresponding path program 1 times [2025-03-04 01:28:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063991077] [2025-03-04 01:28:05,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:05,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:28:05,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:28:05,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:05,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:06,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:06,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063991077] [2025-03-04 01:28:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063991077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:28:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474427268] [2025-03-04 01:28:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:06,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:06,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:06,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:28:06,071 INFO L87 Difference]: Start difference. First operand 201 states and 253 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:06,208 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2025-03-04 01:28:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-04 01:28:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:06,210 INFO L225 Difference]: With dead ends: 345 [2025-03-04 01:28:06,210 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:28:06,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:28:06,211 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 204 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:06,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 313 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:28:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:28:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-04 01:28:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.2) internal successors, (192), 161 states have internal predecessors, (192), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:28:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2025-03-04 01:28:06,232 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 131 [2025-03-04 01:28:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:06,232 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2025-03-04 01:28:06,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2025-03-04 01:28:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:28:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:06,234 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:28:06,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -4210719, now seen corresponding path program 1 times [2025-03-04 01:28:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814691700] [2025-03-04 01:28:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:06,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:28:06,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:28:06,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:06,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:28:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814691700] [2025-03-04 01:28:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814691700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426822090] [2025-03-04 01:28:06,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:06,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:06,764 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-04 01:28:06,766 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-04 01:28:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:28:06,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:28:06,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:06,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:06,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 01:28:06,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:07,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:07,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:07,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:28:07,867 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 22 treesize of output 10 [2025-03-04 01:28:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 290 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:28:07,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:08,269 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 48 treesize of output 44 [2025-03-04 01:28:08,830 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 106 treesize of output 94 [2025-03-04 01:28:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 24 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-04 01:28:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426822090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:28:08,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:28:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 40 [2025-03-04 01:28:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511920919] [2025-03-04 01:28:08,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:28:08,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 01:28:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:08,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 01:28:08,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:28:08,984 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) [2025-03-04 01:28:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:10,218 INFO L93 Difference]: Finished difference Result 375 states and 457 transitions. [2025-03-04 01:28:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 01:28:10,219 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) Word has length 131 [2025-03-04 01:28:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:10,221 INFO L225 Difference]: With dead ends: 375 [2025-03-04 01:28:10,221 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 01:28:10,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=762, Invalid=3144, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 01:28:10,223 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 599 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:10,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1290 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:28:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 01:28:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 213. [2025-03-04 01:28:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.1823529411764706) internal successors, (201), 171 states have internal predecessors, (201), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:28:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2025-03-04 01:28:10,249 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 131 [2025-03-04 01:28:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:10,250 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2025-03-04 01:28:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) [2025-03-04 01:28:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2025-03-04 01:28:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:28:10,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:10,252 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:10,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:10,456 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,SelfDestructingSolverStorable16 [2025-03-04 01:28:10,456 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:10,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2052935537, now seen corresponding path program 1 times [2025-03-04 01:28:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68921075] [2025-03-04 01:28:10,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:10,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:28:10,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:28:10,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:10,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:28:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68921075] [2025-03-04 01:28:10,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68921075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:10,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084310438] [2025-03-04 01:28:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:10,606 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-04 01:28:10,608 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-04 01:28:10,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:28:10,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:28:10,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:10,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:28:10,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:10,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084310438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:28:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56548863] [2025-03-04 01:28:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:10,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:10,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:10,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:10,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:28:10,839 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:10,888 INFO L93 Difference]: Finished difference Result 373 states and 451 transitions. [2025-03-04 01:28:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-03-04 01:28:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:10,890 INFO L225 Difference]: With dead ends: 373 [2025-03-04 01:28:10,890 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 01:28:10,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:28:10,891 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:10,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 01:28:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2025-03-04 01:28:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 172 states have internal predecessors, (202), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:28:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2025-03-04 01:28:10,917 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 258 transitions. Word has length 133 [2025-03-04 01:28:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-03-04 01:28:10,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 258 transitions. [2025-03-04 01:28:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:28:10,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:10,919 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:10,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:11,119 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,SelfDestructingSolverStorable17 [2025-03-04 01:28:11,120 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:11,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2099785062, now seen corresponding path program 1 times [2025-03-04 01:28:11,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:11,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255845307] [2025-03-04 01:28:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:11,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:11,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:11,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:11,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:28:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613956302] [2025-03-04 01:28:11,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:11,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:11,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:11,196 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-04 01:28:11,198 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-04 01:28:11,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:11,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:11,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:11,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 01:28:11,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:11,916 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-04 01:28:11,916 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 25 treesize of output 21 [2025-03-04 01:28:11,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:28:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:28:12,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:12,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255845307] [2025-03-04 01:28:12,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:28:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613956302] [2025-03-04 01:28:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613956302] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-04 01:28:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382360190] [2025-03-04 01:28:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:12,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:12,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:12,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:28:12,163 INFO L87 Difference]: Start difference. First operand 214 states and 258 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:12,360 INFO L93 Difference]: Finished difference Result 470 states and 571 transitions. [2025-03-04 01:28:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-04 01:28:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:12,362 INFO L225 Difference]: With dead ends: 470 [2025-03-04 01:28:12,363 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 01:28:12,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:28:12,363 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:12,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 548 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:28:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 01:28:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 220. [2025-03-04 01:28:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.1864406779661016) internal successors, (210), 178 states have internal predecessors, (210), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:28:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2025-03-04 01:28:12,389 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 135 [2025-03-04 01:28:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:12,389 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2025-03-04 01:28:12,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2025-03-04 01:28:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:28:12,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:12,390 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:12,398 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-04 01:28:12,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:12,591 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2068765255, now seen corresponding path program 1 times [2025-03-04 01:28:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377060863] [2025-03-04 01:28:12,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:12,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:12,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:12,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:28:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146628651] [2025-03-04 01:28:12,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:12,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:12,644 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-04 01:28:12,646 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-04 01:28:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:13,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:13,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:13,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:28:13,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:13,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:13,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:13,286 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 11 [2025-03-04 01:28:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:28:13,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377060863] [2025-03-04 01:28:13,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:28:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146628651] [2025-03-04 01:28:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146628651] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-03-04 01:28:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605474484] [2025-03-04 01:28:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:13,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:13,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:28:13,487 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:13,681 INFO L93 Difference]: Finished difference Result 457 states and 552 transitions. [2025-03-04 01:28:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-04 01:28:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:13,683 INFO L225 Difference]: With dead ends: 457 [2025-03-04 01:28:13,683 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 01:28:13,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:28:13,684 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 201 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:13,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 503 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:28:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 01:28:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 217. [2025-03-04 01:28:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 175 states have internal predecessors, (206), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:28:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2025-03-04 01:28:13,711 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 135 [2025-03-04 01:28:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:13,711 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2025-03-04 01:28:13,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2025-03-04 01:28:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:28:13,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:13,712 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:13,727 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-04 01:28:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:13,913 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:13,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1748985125, now seen corresponding path program 1 times [2025-03-04 01:28:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655233380] [2025-03-04 01:28:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:13,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:13,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:28:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890394969] [2025-03-04 01:28:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:13,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:13,965 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-04 01:28:13,967 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-04 01:28:14,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:14,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:14,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:14,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:28:14,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:14,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:14,449 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 40 [2025-03-04 01:28:14,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:28:14,543 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 11 [2025-03-04 01:28:14,650 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 58 treesize of output 34 [2025-03-04 01:28:14,653 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-04 01:28:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:28:20,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:28:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655233380] [2025-03-04 01:28:20,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:28:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890394969] [2025-03-04 01:28:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890394969] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:20,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-04 01:28:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093085975] [2025-03-04 01:28:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:28:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:28:20,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:28:20,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2025-03-04 01:28:20,509 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:24,781 INFO L93 Difference]: Finished difference Result 393 states and 474 transitions. [2025-03-04 01:28:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:28:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-04 01:28:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:24,783 INFO L225 Difference]: With dead ends: 393 [2025-03-04 01:28:24,783 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 01:28:24,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=33, Invalid=148, Unknown=1, NotChecked=0, Total=182 [2025-03-04 01:28:24,784 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 125 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:24,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 615 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:28:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 01:28:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2025-03-04 01:28:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 177 states have internal predecessors, (208), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:28:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2025-03-04 01:28:24,810 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 135 [2025-03-04 01:28:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:24,811 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2025-03-04 01:28:24,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2025-03-04 01:28:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:28:24,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:24,812 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:24,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:25,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 01:28:25,016 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:25,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2137157946, now seen corresponding path program 1 times [2025-03-04 01:28:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:28:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572617568] [2025-03-04 01:28:25,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:25,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:28:25,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:25,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:25,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:25,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:28:25,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551511350] [2025-03-04 01:28:25,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:25,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:25,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:28:25,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:28:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:25,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:25,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:25,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:28:25,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:28:25,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:28:25,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:28:25,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:25,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:28:25,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:28:25,772 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:28:25,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:28:25,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:25,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:28:25,978 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:26,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:28:26,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:28:26 BoogieIcfgContainer [2025-03-04 01:28:26,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:28:26,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:28:26,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:28:26,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:28:26,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:27:52" (3/4) ... [2025-03-04 01:28:26,143 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:28:26,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:28:26,144 INFO L158 Benchmark]: Toolchain (without parser) took 34451.13ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 113.0MB in the beginning and 45.6MB in the end (delta: 67.4MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,144 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.58ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: Boogie Preprocessor took 70.32ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: IcfgBuilder took 632.79ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 49.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: TraceAbstraction took 33475.34ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 48.5MB in the beginning and 45.6MB in the end (delta: 2.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,145 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 45.6MB in the end (delta: 21.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:28:26,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.58ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 98.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.05ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 95.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.32ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 90.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 632.79ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 49.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33475.34ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 48.5MB in the beginning and 45.6MB in the end (delta: 2.9MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 45.6MB in the end (delta: 21.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L22] unsigned char var_1_1 = 8; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_2 = 59049; [L25] unsigned short int* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 100; [L26] unsigned short int var_1_3 = 100; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_7 = -25; [L30] signed char var_1_7 = -25; [L31] signed char* var_1_7_Pointer = &(var_1_7); [L32] signed char var_1_8 = 16; [L32] signed char var_1_8 = 16; [L33] signed char* var_1_8_Pointer = &(var_1_8); [L34] signed char var_1_9 = 25; [L34] signed char var_1_9 = 25; [L35] signed char* var_1_9_Pointer = &(var_1_9); [L36] signed char var_1_10 = -10; [L36] signed char var_1_10 = -10; [L37] signed char* var_1_10_Pointer = &(var_1_10); [L38] signed char var_1_11 = 0; [L38] signed char var_1_11 = 0; [L39] signed char* var_1_11_Pointer = &(var_1_11); [L40] float var_1_12 = 25.1; [L40] float var_1_12 = 25.1; [L41] float* var_1_12_Pointer = &(var_1_12); [L42] unsigned long int var_1_13 = 2531521428; [L42] unsigned long int var_1_13 = 2531521428; [L43] unsigned long int* var_1_13_Pointer = &(var_1_13); [L44] signed long int var_1_14 = -128; [L44] signed long int var_1_14 = -128; [L45] signed long int* var_1_14_Pointer = &(var_1_14); [L46] signed long int var_1_15 = 256; [L46] signed long int var_1_15 = 256; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_16 = -16; [L48] signed short int var_1_16 = -16; [L49] signed short int* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L77] var_1_2 = __VERIFIER_nondet_ushort() [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_3 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_10 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_13 = __VERIFIER_nondet_ulong() [L98] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_8_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_8_Pointer)) [L54] EXPR \read(*var_1_14_Pointer) [L54] (*(var_1_16_Pointer)) = (*(var_1_14_Pointer)) [L55] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] signed long int stepLocal_0 = ((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))); [L56] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_2_Pointer)) <= stepLocal_0) [L59] EXPR \read(*var_1_10_Pointer) [L59] (*(var_1_7_Pointer)) = (*(var_1_10_Pointer)) [L61] EXPR \read(*var_1_16_Pointer) [L61] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_15_Pointer) [L62] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L67] EXPR \read(*var_1_1_Pointer) [L67] unsigned char stepLocal_1 = (*(var_1_1_Pointer)); [L68] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L68] COND FALSE !(2.75f > (*(var_1_12_Pointer))) [L71] EXPR \read(*var_1_13_Pointer) [L71] EXPR \read(*var_1_14_Pointer) [L71] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, stepLocal_1=3, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE ((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > stepLocal_1 [L72] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))) [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] (*(var_1_11_Pointer)) = (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_6_Pointer) [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) [L104] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1) [L104] EXPR \read(*var_1_11_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104-L105] return (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17: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_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4052 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4052 mSDsluCounter, 12883 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9920 mSDsCounter, 718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3987 IncrementalHoareTripleChecker+Invalid, 4705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 718 mSolverCounterUnsat, 2963 mSDtfsCounter, 3987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2072 GetRequests, 1795 SyntacticMatches, 2 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=12, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 408 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 4012 NumberOfCodeBlocks, 4012 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4095 ConstructedInterpolants, 99 QuantifiedInterpolants, 20413 SizeOfPredicates, 73 NumberOfNonLiveVariables, 4962 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 32 InterpolantComputations, 18 PerfectInterpolantSequences, 11787/13440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:28:26,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:28:27,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:28:28,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:28:28,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:28:28,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:28:28,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:28:28,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:28:28,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:28:28,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:28:28,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:28:28,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:28:28,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:28:28,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:28:28,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:28,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:28:28,038 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:28,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:28:28,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:28:28,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:28:28,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:28:28,039 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2025-03-04 01:28:28,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:28:28,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:28:28,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:28:28,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:28:28,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:28:28,294 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-37.i [2025-03-04 01:28:29,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b0b056/5fe9915e14924048bb28d4f5a9627629/FLAGdb79d068d [2025-03-04 01:28:29,596 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:28:29,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-03-04 01:28:29,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b0b056/5fe9915e14924048bb28d4f5a9627629/FLAGdb79d068d [2025-03-04 01:28:29,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90b0b056/5fe9915e14924048bb28d4f5a9627629 [2025-03-04 01:28:29,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:28:29,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:28:29,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:29,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:28:30,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:28:30,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:29" (1/1) ... [2025-03-04 01:28:30,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d776e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30, skipping insertion in model container [2025-03-04 01:28:30,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:28:29" (1/1) ... [2025-03-04 01:28:30,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:28:30,116 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-37.i[916,929] [2025-03-04 01:28:30,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:30,184 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:28:30,192 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-37.i[916,929] [2025-03-04 01:28:30,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:28:30,228 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:28:30,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30 WrapperNode [2025-03-04 01:28:30,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:28:30,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:30,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:28:30,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:28:30,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,286 INFO L138 Inliner]: procedures = 36, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-03-04 01:28:30,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:28:30,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:28:30,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:28:30,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:28:30,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,336 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-03-04 01:28:30,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:28:30,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:28:30,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:28:30,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:28:30,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (1/1) ... [2025-03-04 01:28:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:28:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:28:30,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:28:30,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 01:28:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:28:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:28:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:28:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:28:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:28:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 01:28:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:28:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-04 01:28:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:28:30,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:28:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:28:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:28:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:28:30,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:28:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:28:30,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:28:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:28:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-04 01:28:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-04 01:28:30,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:28:30,682 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:28:31,209 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite78#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem83#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem92#1;havoc property_#t~ite114#1;havoc property_#t~mem95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem107#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-03-04 01:28:31,244 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-04 01:28:31,244 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:28:31,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:28:31,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:28:31,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:31 BoogieIcfgContainer [2025-03-04 01:28:31,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:28:31,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:28:31,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:28:31,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:28:31,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:28:29" (1/3) ... [2025-03-04 01:28:31,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6c9fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:31, skipping insertion in model container [2025-03-04 01:28:31,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:28:30" (2/3) ... [2025-03-04 01:28:31,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6c9fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:28:31, skipping insertion in model container [2025-03-04 01:28:31,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:28:31" (3/3) ... [2025-03-04 01:28:31,261 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2025-03-04 01:28:31,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:28:31,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:28:31,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:28:31,315 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;@21f7c98e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:28:31,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:28:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:31,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:31,326 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:31,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:31,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1440740167, now seen corresponding path program 1 times [2025-03-04 01:28:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454697897] [2025-03-04 01:28:31,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:31,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:31,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:31,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:28:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:31,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:31,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:31,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:31,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:28:31,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:28:31,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:31,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454697897] [2025-03-04 01:28:31,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454697897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:31,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:28:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493062354] [2025-03-04 01:28:31,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:28:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:31,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:28:31,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:28:31,732 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:31,753 INFO L93 Difference]: Finished difference Result 186 states and 286 transitions. [2025-03-04 01:28:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:28:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-04 01:28:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:31,760 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:28:31,760 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 01:28:31,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:28:31,764 INFO L435 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:31,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 01:28:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 01:28:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-04 01:28:31,795 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2025-03-04 01:28:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-04 01:28:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-04 01:28:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:31,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:31,798 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:31,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:28:31,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:31,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash -201986512, now seen corresponding path program 1 times [2025-03-04 01:28:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551036640] [2025-03-04 01:28:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:32,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:32,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:28:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:32,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:28:32,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-04 01:28:32,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:32,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551036640] [2025-03-04 01:28:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551036640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:28:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:28:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146271991] [2025-03-04 01:28:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:32,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:28:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:32,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:28:32,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:28:32,355 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:32,400 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2025-03-04 01:28:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:28:32,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-03-04 01:28:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:32,404 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:28:32,404 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:28:32,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:28:32,406 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:32,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:28:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:28:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-04 01:28:32,416 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 122 [2025-03-04 01:28:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:32,418 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-04 01:28:32,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:28:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-04 01:28:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:32,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:32,420 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:32,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:28:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:32,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1498753967, now seen corresponding path program 1 times [2025-03-04 01:28:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:32,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199137873] [2025-03-04 01:28:32,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:32,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:32,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:28:32,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:32,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:32,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:32,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:28:32,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:33,265 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 19 treesize of output 11 [2025-03-04 01:28:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:28:33,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:33,491 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:28:33,491 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-04 01:28:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:28:33,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199137873] [2025-03-04 01:28:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199137873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:28:33,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:28:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-04 01:28:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716085705] [2025-03-04 01:28:33,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:28:33,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:28:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:33,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:28:33,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:28:33,582 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 01:28:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:34,057 INFO L93 Difference]: Finished difference Result 193 states and 272 transitions. [2025-03-04 01:28:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:28:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 122 [2025-03-04 01:28:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:34,059 INFO L225 Difference]: With dead ends: 193 [2025-03-04 01:28:34,059 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:28:34,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:28:34,060 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 175 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:34,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 520 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:28:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:28:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-03-04 01:28:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-03-04 01:28:34,069 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 122 [2025-03-04 01:28:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-03-04 01:28:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 01:28:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-03-04 01:28:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:34,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:34,070 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:34,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:28:34,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:34,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1551448848, now seen corresponding path program 1 times [2025-03-04 01:28:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092541585] [2025-03-04 01:28:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:34,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:34,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:28:34,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:34,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:34,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:34,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:28:34,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:35,236 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-04 01:28:35,240 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 13 treesize of output 9 [2025-03-04 01:28:35,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:28:35,320 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-04 01:28:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 01:28:35,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:35,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:28:35,696 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 27 treesize of output 30 [2025-03-04 01:28:35,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092541585] [2025-03-04 01:28:35,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092541585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:35,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [402283655] [2025-03-04 01:28:35,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:35,822 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:35,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:28:35,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:28:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 01:28:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:36,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:36,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:36,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:28:36,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:36,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [402283655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-04 01:28:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837422668] [2025-03-04 01:28:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:36,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:28:36,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:36,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:28:36,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:28:36,226 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:36,260 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2025-03-04 01:28:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:28:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-04 01:28:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:36,262 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:28:36,262 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:28:36,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:28:36,263 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:36,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 492 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:28:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-04 01:28:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2025-03-04 01:28:36,270 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 122 [2025-03-04 01:28:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:36,270 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2025-03-04 01:28:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:36,270 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2025-03-04 01:28:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:36,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:36,271 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:36,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:28:36,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:36,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:36,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:36,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:36,676 INFO L85 PathProgramCache]: Analyzing trace with hash 936063985, now seen corresponding path program 1 times [2025-03-04 01:28:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305798219] [2025-03-04 01:28:36,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:36,678 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:36,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:28:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:36,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:28:36,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:37,537 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-04 01:28:37,540 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 13 treesize of output 9 [2025-03-04 01:28:37,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:28:37,611 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-04 01:28:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 01:28:37,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:37,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:28:37,936 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 27 treesize of output 30 [2025-03-04 01:28:38,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305798219] [2025-03-04 01:28:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305798219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739072670] [2025-03-04 01:28:38,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:28:38,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:28:38,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-04 01:28:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:38,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:38,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:38,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:38,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:28:38,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:38,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1739072670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:38,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-03-04 01:28:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911963766] [2025-03-04 01:28:38,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:38,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:38,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:28:38,390 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:38,431 INFO L93 Difference]: Finished difference Result 206 states and 283 transitions. [2025-03-04 01:28:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:38,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-04 01:28:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:38,433 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:28:38,434 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:28:38,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:28:38,435 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:38,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 605 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:28:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:28:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2025-03-04 01:28:38,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 122 [2025-03-04 01:28:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:38,447 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2025-03-04 01:28:38,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2025-03-04 01:28:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:38,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:38,453 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:38,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:28:38,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:28:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:38,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:38,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1823567666, now seen corresponding path program 1 times [2025-03-04 01:28:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573332632] [2025-03-04 01:28:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:38,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:38,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:38,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:38,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:28:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:39,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:39,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:39,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:39,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:28:39,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:39,598 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-04 01:28:39,600 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 13 treesize of output 9 [2025-03-04 01:28:39,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:28:39,693 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-04 01:28:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 01:28:39,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:39,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:28:39,971 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 27 treesize of output 30 [2025-03-04 01:28:40,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573332632] [2025-03-04 01:28:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573332632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191984642] [2025-03-04 01:28:40,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:40,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:28:40,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:28:40,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:28:40,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:40,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:40,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:40,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:40,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:28:40,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:40,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [191984642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-03-04 01:28:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678088498] [2025-03-04 01:28:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:40,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:28:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:28:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:28:40,447 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:40,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:40,499 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions. [2025-03-04 01:28:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:28:40,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-04 01:28:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:40,502 INFO L225 Difference]: With dead ends: 210 [2025-03-04 01:28:40,502 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:28:40,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:28:40,503 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:40,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 719 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:28:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:28:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-04 01:28:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2025-03-04 01:28:40,509 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 122 [2025-03-04 01:28:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:40,509 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2025-03-04 01:28:40,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2025-03-04 01:28:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:40,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:40,510 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:40,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:28:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:28:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:40,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:40,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1824491187, now seen corresponding path program 1 times [2025-03-04 01:28:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:40,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182788629] [2025-03-04 01:28:40,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:40,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:40,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:40,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:28:41,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:41,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:41,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:28:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:41,664 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-04 01:28:41,668 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 13 treesize of output 9 [2025-03-04 01:28:41,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:28:41,734 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-04 01:28:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 01:28:41,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:41,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:28:41,991 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 27 treesize of output 30 [2025-03-04 01:28:42,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182788629] [2025-03-04 01:28:42,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182788629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142638483] [2025-03-04 01:28:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:28:42,076 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:28:42,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:28:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:42,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:42,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:42,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:42,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:28:42,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:42,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:28:43,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 01:28:43,506 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 13 treesize of output 9 [2025-03-04 01:28:43,581 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 25 treesize of output 13 [2025-03-04 01:28:43,642 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 26 treesize of output 14 [2025-03-04 01:28:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:28:43,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:43,715 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 26 treesize of output 18 [2025-03-04 01:28:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [142638483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:43,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:28:43,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-03-04 01:28:43,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557567828] [2025-03-04 01:28:43,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:28:43,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 01:28:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:43,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 01:28:43,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:28:43,836 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-04 01:28:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:45,630 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2025-03-04 01:28:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:28:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) Word has length 122 [2025-03-04 01:28:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:45,632 INFO L225 Difference]: With dead ends: 225 [2025-03-04 01:28:45,632 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:28:45,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=524, Invalid=2128, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 01:28:45,634 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 512 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:45,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 966 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:28:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:28:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-03-04 01:28:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:28:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2025-03-04 01:28:45,649 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 122 [2025-03-04 01:28:45,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2025-03-04 01:28:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-04 01:28:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2025-03-04 01:28:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:28:45,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:45,653 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:45,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:28:45,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:28:46,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:46,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2035842100, now seen corresponding path program 1 times [2025-03-04 01:28:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571045942] [2025-03-04 01:28:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:46,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:46,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:46,057 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:46,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:28:46,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:46,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:46,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:46,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:46,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:28:46,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:47,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-04 01:28:47,520 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 11 [2025-03-04 01:28:47,610 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-04 01:28:47,614 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-04 01:28:47,618 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 29 treesize of output 17 [2025-03-04 01:28:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 01:28:47,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:28:54,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:28:54,585 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 64 treesize of output 59 [2025-03-04 01:28:56,047 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:28:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571045942] [2025-03-04 01:28:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571045942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:28:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547331530] [2025-03-04 01:28:56,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:56,048 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:28:56,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:28:56,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:28:56,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-04 01:28:56,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:28:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:28:56,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:56,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:56,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 01:28:56,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:57,331 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-04 01:28:57,469 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-04 01:28:57,471 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-04 01:28:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:28:57,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:28:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1547331530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:28:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:28:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2025-03-04 01:28:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413052109] [2025-03-04 01:28:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:28:57,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:28:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:28:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:28:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:28:57,667 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:28:58,049 INFO L93 Difference]: Finished difference Result 243 states and 315 transitions. [2025-03-04 01:28:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:28:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-03-04 01:28:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:28:58,051 INFO L225 Difference]: With dead ends: 243 [2025-03-04 01:28:58,051 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 01:28:58,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:28:58,052 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 80 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:28:58,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 439 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:28:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 01:28:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-03-04 01:28:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 105 states have internal predecessors, (128), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 01:28:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-03-04 01:28:58,071 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 122 [2025-03-04 01:28:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:28:58,072 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-03-04 01:28:58,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:28:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2025-03-04 01:28:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:28:58,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:28:58,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:28:58,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-03-04 01:28:58,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:28:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:58,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:28:58,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:28:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522446, now seen corresponding path program 1 times [2025-03-04 01:28:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:28:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259738904] [2025-03-04 01:28:58,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:28:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:28:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:28:58,477 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:28:58,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-04 01:28:58,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:28:58,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:28:58,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:58,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:58,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:28:58,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:28:59,938 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 38 treesize of output 26 [2025-03-04 01:28:59,941 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 11 [2025-03-04 01:29:00,024 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-04 01:29:00,029 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 29 treesize of output 17 [2025-03-04 01:29:00,036 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-04 01:29:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 01:29:00,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:29:06,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:29:06,581 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 64 treesize of output 59 [2025-03-04 01:29:08,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:29:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259738904] [2025-03-04 01:29:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259738904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:29:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [779817196] [2025-03-04 01:29:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:08,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:29:08,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:29:08,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:29:08,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-04 01:29:08,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:29:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:29:08,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:08,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:08,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:29:08,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:09,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 16 treesize of output 8 [2025-03-04 01:29:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:29:09,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:29:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [779817196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:29:09,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:29:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2025-03-04 01:29:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109188277] [2025-03-04 01:29:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:29:09,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:29:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:29:09,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:29:09,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:29:09,141 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:29:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:29:09,352 INFO L93 Difference]: Finished difference Result 287 states and 367 transitions. [2025-03-04 01:29:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:29:09,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-03-04 01:29:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:29:09,354 INFO L225 Difference]: With dead ends: 287 [2025-03-04 01:29:09,354 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:29:09,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=249, Invalid=1233, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 01:29:09,355 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 115 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:29:09,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 557 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:29:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:29:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2025-03-04 01:29:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:29:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2025-03-04 01:29:09,369 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 125 [2025-03-04 01:29:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:29:09,370 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2025-03-04 01:29:09,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:29:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2025-03-04 01:29:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:29:09,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:29:09,371 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:29:09,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-03-04 01:29:09,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-04 01:29:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:29:09,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:29:09,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:29:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1750893041, now seen corresponding path program 1 times [2025-03-04 01:29:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:29:09,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666441648] [2025-03-04 01:29:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:29:09,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:29:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:29:09,774 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:29:09,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-04 01:29:09,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:29:09,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:29:09,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:29:09,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:29:10,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:29:10,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:29:11,169 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 38 treesize of output 26 [2025-03-04 01:29:11,173 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 11 [2025-03-04 01:29:11,263 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-04 01:29:11,267 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 29 treesize of output 17 [2025-03-04 01:29:11,273 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-04 01:29:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 01:29:11,329 INFO L312 TraceCheckSpWp]: Computing backward predicates...