./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:26,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:26,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:39:26,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:26,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:26,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:26,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:26,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:26,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:26,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:26,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:26,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:26,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:26,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:26,973 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:26,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:26,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:26,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:26,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:26,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:26,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:26,979 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2025-02-06 03:39:27,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:27,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:27,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:27,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:27,221 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:27,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:39:28,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9662416f0/789707bb0ede4e23bb0b2fda3bfad8eb/FLAG486df1a75 [2025-02-06 03:39:28,652 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:28,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:39:28,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9662416f0/789707bb0ede4e23bb0b2fda3bfad8eb/FLAG486df1a75 [2025-02-06 03:39:28,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9662416f0/789707bb0ede4e23bb0b2fda3bfad8eb [2025-02-06 03:39:28,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:28,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:28,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:28,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:28,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:28,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:28" (1/1) ... [2025-02-06 03:39:28,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c3f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:28, skipping insertion in model container [2025-02-06 03:39:28,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:28" (1/1) ... [2025-02-06 03:39:29,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:29,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2025-02-06 03:39:29,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:29,187 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:29,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2025-02-06 03:39:29,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:29,253 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:29,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29 WrapperNode [2025-02-06 03:39:29,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:29,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:29,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:29,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:29,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,309 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2025-02-06 03:39:29,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:29,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:29,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:29,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:29,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,342 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:39:29,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:29,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:29,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:29,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:29,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (1/1) ... [2025-02-06 03:39:29,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:29,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:39:29,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:39:29,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:39:29,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:39:29,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:39:29,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:39:29,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:29,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:39:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:29,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:29,614 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:29,615 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:30,014 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:39:30,056 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:30,056 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:30,067 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:30,067 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:30,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:30 BoogieIcfgContainer [2025-02-06 03:39:30,068 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:30,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:30,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:30,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:30,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:28" (1/3) ... [2025-02-06 03:39:30,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9cedee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:30, skipping insertion in model container [2025-02-06 03:39:30,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:29" (2/3) ... [2025-02-06 03:39:30,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9cedee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:30, skipping insertion in model container [2025-02-06 03:39:30,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:30" (3/3) ... [2025-02-06 03:39:30,075 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:39:30,085 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:30,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-4.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:30,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:30,142 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;@13572d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:30,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 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-02-06 03:39:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:39:30,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:30,164 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] [2025-02-06 03:39:30,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:30,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash -179533020, now seen corresponding path program 1 times [2025-02-06 03:39:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:30,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720049103] [2025-02-06 03:39:30,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:30,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:30,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:30,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:39:30,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:30,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720049103] [2025-02-06 03:39:30,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720049103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:30,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558767023] [2025-02-06 03:39:30,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:30,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:30,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:30,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:39:30,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:39:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:30,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:30,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:30,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:30,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:30,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:39:30,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558767023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:30,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:39:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087513523] [2025-02-06 03:39:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:30,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:30,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:30,780 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-02-06 03:39:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:30,796 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2025-02-06 03:39:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (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 130 [2025-02-06 03:39:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:30,802 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:39:30,802 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:39:30,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-02-06 03:39:30,806 INFO L435 NwaCegarLoop]: 154 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, 154 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-02-06 03:39:30,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:39:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:39:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 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-02-06 03:39:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-02-06 03:39:30,846 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2025-02-06 03:39:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:30,846 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-02-06 03:39:30,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (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-02-06 03:39:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-02-06 03:39:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:39:30,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:30,851 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] [2025-02-06 03:39:30,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:39:31,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:39:31,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -431844915, now seen corresponding path program 1 times [2025-02-06 03:39:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930585534] [2025-02-06 03:39:31,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:31,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:31,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930585534] [2025-02-06 03:39:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930585534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423383562] [2025-02-06 03:39:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:31,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:31,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:31,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:31,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:31,395 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:39:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:31,427 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-02-06 03:39:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 130 [2025-02-06 03:39:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:31,432 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:39:31,432 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 03:39:31,432 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-02-06 03:39:31,433 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:31,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 03:39:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-02-06 03:39:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 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-02-06 03:39:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-02-06 03:39:31,443 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2025-02-06 03:39:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:31,446 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-02-06 03:39:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:39:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-02-06 03:39:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:39:31,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:31,447 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] [2025-02-06 03:39:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:39:31,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -430921394, now seen corresponding path program 1 times [2025-02-06 03:39:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790172197] [2025-02-06 03:39:31,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:31,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:31,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:31,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:32,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790172197] [2025-02-06 03:39:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790172197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:32,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223654630] [2025-02-06 03:39:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:32,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:32,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:32,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:32,269 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 03:39:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:32,482 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2025-02-06 03:39:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 130 [2025-02-06 03:39:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:32,485 INFO L225 Difference]: With dead ends: 283 [2025-02-06 03:39:32,485 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 03:39:32,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:32,486 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 148 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:32,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 916 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 03:39:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2025-02-06 03:39:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 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-02-06 03:39:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-02-06 03:39:32,504 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2025-02-06 03:39:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:32,504 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-02-06 03:39:32,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-06 03:39:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-02-06 03:39:32,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:39:32,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:32,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, 1, 1, 1] [2025-02-06 03:39:32,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:39:32,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:32,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2067094543, now seen corresponding path program 1 times [2025-02-06 03:39:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251146698] [2025-02-06 03:39:32,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:32,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:32,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:32,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:32,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:32,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251146698] [2025-02-06 03:39:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251146698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487650402] [2025-02-06 03:39:32,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:32,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:32,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:32,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:39:32,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:39:32,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:39:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:39:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:32,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:39:32,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:32,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487650402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:39:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893362504] [2025-02-06 03:39:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:32,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:32,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:32,976 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:39:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:33,003 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2025-02-06 03:39:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:33,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 130 [2025-02-06 03:39:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:33,007 INFO L225 Difference]: With dead ends: 219 [2025-02-06 03:39:33,007 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 03:39:33,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:33,010 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:33,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 03:39:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 03:39:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 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-02-06 03:39:33,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-02-06 03:39:33,027 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 130 [2025-02-06 03:39:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-02-06 03:39:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:39:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-02-06 03:39:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:39:33,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:33,030 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] [2025-02-06 03:39:33,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:39:33,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:33,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1343112681, now seen corresponding path program 1 times [2025-02-06 03:39:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378301886] [2025-02-06 03:39:33,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:39:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:39:33,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378301886] [2025-02-06 03:39:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378301886] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449526447] [2025-02-06 03:39:33,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:33,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:39:33,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:39:33,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:39:33,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:39:33,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:33,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:39:33,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:33,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449526447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:39:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227216285] [2025-02-06 03:39:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:33,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:33,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:33,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:33,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:33,678 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 03:39:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:33,705 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2025-02-06 03:39:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 132 [2025-02-06 03:39:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:33,707 INFO L225 Difference]: With dead ends: 224 [2025-02-06 03:39:33,707 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 03:39:33,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:33,708 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 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-02-06 03:39:33,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 03:39:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-02-06 03:39:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 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-02-06 03:39:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-02-06 03:39:33,721 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 132 [2025-02-06 03:39:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:33,721 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-02-06 03:39:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 03:39:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-02-06 03:39:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:33,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:33,722 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] [2025-02-06 03:39:33,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:39:33,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:33,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:33,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash -153265237, now seen corresponding path program 1 times [2025-02-06 03:39:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678097437] [2025-02-06 03:39:33,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:33,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:33,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678097437] [2025-02-06 03:39:35,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678097437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:35,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:35,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274525899] [2025-02-06 03:39:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:35,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:35,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:35,039 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 03:39:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:35,939 INFO L93 Difference]: Finished difference Result 351 states and 499 transitions. [2025-02-06 03:39:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:39:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 134 [2025-02-06 03:39:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:35,942 INFO L225 Difference]: With dead ends: 351 [2025-02-06 03:39:35,942 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 03:39:35,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:39:35,943 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 895 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:35,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 828 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:39:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 03:39:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 175. [2025-02-06 03:39:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.355263157894737) internal successors, (206), 153 states have internal predecessors, (206), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2025-02-06 03:39:35,957 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 134 [2025-02-06 03:39:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2025-02-06 03:39:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 03:39:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2025-02-06 03:39:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:35,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:35,958 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] [2025-02-06 03:39:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:39:35,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1354286572, now seen corresponding path program 1 times [2025-02-06 03:39:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570638299] [2025-02-06 03:39:35,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:35,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:36,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570638299] [2025-02-06 03:39:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570638299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:36,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447587134] [2025-02-06 03:39:36,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:36,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:36,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:36,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:36,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:36,520 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:36,622 INFO L93 Difference]: Finished difference Result 407 states and 568 transitions. [2025-02-06 03:39:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:36,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:36,625 INFO L225 Difference]: With dead ends: 407 [2025-02-06 03:39:36,625 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:39:36,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:36,626 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 36 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 555 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:36,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 555 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:39:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 179. [2025-02-06 03:39:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 157 states have internal predecessors, (210), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2025-02-06 03:39:36,637 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 134 [2025-02-06 03:39:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:36,637 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2025-02-06 03:39:36,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2025-02-06 03:39:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:36,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:36,638 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] [2025-02-06 03:39:36,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:39:36,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 363779242, now seen corresponding path program 1 times [2025-02-06 03:39:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68706325] [2025-02-06 03:39:36,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:36,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:36,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:36,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68706325] [2025-02-06 03:39:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68706325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:39:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911140248] [2025-02-06 03:39:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:39:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:37,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:39:37,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:37,625 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-02-06 03:39:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:38,066 INFO L93 Difference]: Finished difference Result 377 states and 520 transitions. [2025-02-06 03:39:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:39:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:38,068 INFO L225 Difference]: With dead ends: 377 [2025-02-06 03:39:38,068 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 03:39:38,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:39:38,069 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 272 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:38,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 987 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 03:39:38,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-02-06 03:39:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 172 states have internal predecessors, (224), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 270 transitions. [2025-02-06 03:39:38,083 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 270 transitions. Word has length 134 [2025-02-06 03:39:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:38,083 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 270 transitions. [2025-02-06 03:39:38,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-02-06 03:39:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 270 transitions. [2025-02-06 03:39:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:38,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:38,084 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] [2025-02-06 03:39:38,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:39:38,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:38,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1433172117, now seen corresponding path program 1 times [2025-02-06 03:39:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:38,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265746476] [2025-02-06 03:39:38,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:38,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:38,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:38,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:38,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:38,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265746476] [2025-02-06 03:39:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265746476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32677887] [2025-02-06 03:39:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:38,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:38,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:38,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:38,450 INFO L87 Difference]: Start difference. First operand 198 states and 270 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:38,683 INFO L93 Difference]: Finished difference Result 383 states and 524 transitions. [2025-02-06 03:39:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:38,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:38,685 INFO L225 Difference]: With dead ends: 383 [2025-02-06 03:39:38,685 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 03:39:38,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:38,686 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 256 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:38,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 596 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 03:39:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-02-06 03:39:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 171 states have internal predecessors, (222), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2025-02-06 03:39:38,704 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 134 [2025-02-06 03:39:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:38,705 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2025-02-06 03:39:38,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2025-02-06 03:39:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:38,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:38,706 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] [2025-02-06 03:39:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:39:38,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1496185254, now seen corresponding path program 1 times [2025-02-06 03:39:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101949727] [2025-02-06 03:39:38,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:38,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:40,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-02-06 03:39:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101949727] [2025-02-06 03:39:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101949727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:39:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354491133] [2025-02-06 03:39:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:40,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:39:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:40,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:39:40,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:40,143 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-02-06 03:39:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:41,569 INFO L93 Difference]: Finished difference Result 426 states and 583 transitions. [2025-02-06 03:39:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:41,573 INFO L225 Difference]: With dead ends: 426 [2025-02-06 03:39:41,573 INFO L226 Difference]: Without dead ends: 243 [2025-02-06 03:39:41,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:39:41,574 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 363 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:41,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 496 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:39:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-06 03:39:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2025-02-06 03:39:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 196 states have internal predecessors, (256), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2025-02-06 03:39:41,598 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 134 [2025-02-06 03:39:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:41,598 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2025-02-06 03:39:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-02-06 03:39:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2025-02-06 03:39:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:41,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:41,602 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] [2025-02-06 03:39:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:39:41,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:41,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1713430101, now seen corresponding path program 1 times [2025-02-06 03:39:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743453223] [2025-02-06 03:39:41,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:41,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:41,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:42,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743453223] [2025-02-06 03:39:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743453223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801326574] [2025-02-06 03:39:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:42,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:42,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:42,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:42,006 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:42,287 INFO L93 Difference]: Finished difference Result 462 states and 628 transitions. [2025-02-06 03:39:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:42,290 INFO L225 Difference]: With dead ends: 462 [2025-02-06 03:39:42,290 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 03:39:42,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:42,292 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 341 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:42,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 673 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 03:39:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2025-02-06 03:39:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.320754716981132) internal successors, (280), 214 states have internal predecessors, (280), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 326 transitions. [2025-02-06 03:39:42,313 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 326 transitions. Word has length 134 [2025-02-06 03:39:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:42,314 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 326 transitions. [2025-02-06 03:39:42,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 326 transitions. [2025-02-06 03:39:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:42,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:42,315 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] [2025-02-06 03:39:42,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:39:42,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash 784585836, now seen corresponding path program 1 times [2025-02-06 03:39:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774834846] [2025-02-06 03:39:42,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:42,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:42,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:42,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:42,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774834846] [2025-02-06 03:39:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774834846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133380885] [2025-02-06 03:39:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:43,118 INFO L87 Difference]: Start difference. First operand 240 states and 326 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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-02-06 03:39:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:43,840 INFO L93 Difference]: Finished difference Result 493 states and 667 transitions. [2025-02-06 03:39:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:39:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:43,843 INFO L225 Difference]: With dead ends: 493 [2025-02-06 03:39:43,843 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 03:39:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:39:43,844 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 316 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:43,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1533 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 03:39:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2025-02-06 03:39:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3177570093457944) internal successors, (282), 216 states have internal predecessors, (282), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2025-02-06 03:39:43,863 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 134 [2025-02-06 03:39:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:43,864 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2025-02-06 03:39:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 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-02-06 03:39:43,864 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2025-02-06 03:39:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:43,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:43,866 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] [2025-02-06 03:39:43,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:39:43,866 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash 500928678, now seen corresponding path program 1 times [2025-02-06 03:39:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546685867] [2025-02-06 03:39:43,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:43,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:43,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:44,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546685867] [2025-02-06 03:39:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546685867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:44,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002041435] [2025-02-06 03:39:44,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:44,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:44,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:44,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:44,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:44,235 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:44,652 INFO L93 Difference]: Finished difference Result 481 states and 651 transitions. [2025-02-06 03:39:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:44,655 INFO L225 Difference]: With dead ends: 481 [2025-02-06 03:39:44,655 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 03:39:44,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:44,656 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 47 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:44,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 686 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 03:39:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2025-02-06 03:39:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 214 states have internal predecessors, (278), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 324 transitions. [2025-02-06 03:39:44,672 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 324 transitions. Word has length 134 [2025-02-06 03:39:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 324 transitions. [2025-02-06 03:39:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 324 transitions. [2025-02-06 03:39:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:44,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:44,673 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] [2025-02-06 03:39:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:39:44,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:44,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1633334690, now seen corresponding path program 1 times [2025-02-06 03:39:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853669711] [2025-02-06 03:39:44,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:44,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:44,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:44,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:44,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853669711] [2025-02-06 03:39:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853669711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:45,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:39:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136247641] [2025-02-06 03:39:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:39:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:45,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:39:45,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:45,016 INFO L87 Difference]: Start difference. First operand 240 states and 324 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-02-06 03:39:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:45,258 INFO L93 Difference]: Finished difference Result 546 states and 736 transitions. [2025-02-06 03:39:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:39:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:45,261 INFO L225 Difference]: With dead ends: 546 [2025-02-06 03:39:45,262 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 03:39:45,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:39:45,263 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 70 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:45,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1603 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 03:39:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2025-02-06 03:39:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 272 states have (on average 1.3088235294117647) internal successors, (356), 275 states have internal predecessors, (356), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 412 transitions. [2025-02-06 03:39:45,287 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 412 transitions. Word has length 134 [2025-02-06 03:39:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:45,288 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 412 transitions. [2025-02-06 03:39:45,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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-02-06 03:39:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 412 transitions. [2025-02-06 03:39:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:45,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:45,289 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] [2025-02-06 03:39:45,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:39:45,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -163616669, now seen corresponding path program 1 times [2025-02-06 03:39:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874184568] [2025-02-06 03:39:45,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:45,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:45,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874184568] [2025-02-06 03:39:45,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874184568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:45,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:45,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545087212] [2025-02-06 03:39:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:45,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:45,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:45,596 INFO L87 Difference]: Start difference. First operand 306 states and 412 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:45,862 INFO L93 Difference]: Finished difference Result 613 states and 823 transitions. [2025-02-06 03:39:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:45,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:45,865 INFO L225 Difference]: With dead ends: 613 [2025-02-06 03:39:45,865 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 03:39:45,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:45,867 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 198 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:45,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 739 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 03:39:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 271. [2025-02-06 03:39:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 243 states have (on average 1.316872427983539) internal successors, (320), 245 states have internal predecessors, (320), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:39:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 366 transitions. [2025-02-06 03:39:45,884 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 366 transitions. Word has length 134 [2025-02-06 03:39:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:45,886 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 366 transitions. [2025-02-06 03:39:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-02-06 03:39:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 366 transitions. [2025-02-06 03:39:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:45,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:45,887 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] [2025-02-06 03:39:45,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:39:45,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:45,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -443874653, now seen corresponding path program 1 times [2025-02-06 03:39:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:45,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359636917] [2025-02-06 03:39:45,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:45,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:45,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:46,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:46,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359636917] [2025-02-06 03:39:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359636917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:46,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:46,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164539973] [2025-02-06 03:39:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:46,095 INFO L87 Difference]: Start difference. First operand 271 states and 366 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:46,215 INFO L93 Difference]: Finished difference Result 557 states and 747 transitions. [2025-02-06 03:39:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:46,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:46,217 INFO L225 Difference]: With dead ends: 557 [2025-02-06 03:39:46,217 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 03:39:46,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-06 03:39:46,218 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 59 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:46,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 650 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 03:39:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 249. [2025-02-06 03:39:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 224 states have (on average 1.3125) internal successors, (294), 225 states have internal predecessors, (294), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 334 transitions. [2025-02-06 03:39:46,242 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 334 transitions. Word has length 134 [2025-02-06 03:39:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 334 transitions. [2025-02-06 03:39:46,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-02-06 03:39:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 334 transitions. [2025-02-06 03:39:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:39:46,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:46,244 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] [2025-02-06 03:39:46,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:39:46,244 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:46,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2054141284, now seen corresponding path program 1 times [2025-02-06 03:39:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:46,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604601503] [2025-02-06 03:39:46,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:39:46,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:39:46,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:46,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:46,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:46,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604601503] [2025-02-06 03:39:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604601503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 03:39:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36642247] [2025-02-06 03:39:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:46,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:39:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:46,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:39:46,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:46,820 INFO L87 Difference]: Start difference. First operand 249 states and 334 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-02-06 03:39:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:47,281 INFO L93 Difference]: Finished difference Result 526 states and 704 transitions. [2025-02-06 03:39:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:39:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 134 [2025-02-06 03:39:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:47,283 INFO L225 Difference]: With dead ends: 526 [2025-02-06 03:39:47,283 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 03:39:47,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:39:47,284 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 321 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:47,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1338 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 03:39:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2025-02-06 03:39:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 224 states have internal predecessors, (293), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 333 transitions. [2025-02-06 03:39:47,301 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 333 transitions. Word has length 134 [2025-02-06 03:39:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:47,301 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 333 transitions. [2025-02-06 03:39:47,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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-02-06 03:39:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 333 transitions. [2025-02-06 03:39:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:39:47,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:47,303 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-02-06 03:39:47,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:39:47,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1922709400, now seen corresponding path program 1 times [2025-02-06 03:39:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908585487] [2025-02-06 03:39:47,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:47,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:47,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:47,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:47,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908585487] [2025-02-06 03:39:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908585487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090596313] [2025-02-06 03:39:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:47,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:47,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:47,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:47,547 INFO L87 Difference]: Start difference. First operand 248 states and 333 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-02-06 03:39:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:47,636 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2025-02-06 03:39:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:47,637 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-02-06 03:39:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:47,640 INFO L225 Difference]: With dead ends: 571 [2025-02-06 03:39:47,640 INFO L226 Difference]: Without dead ends: 326 [2025-02-06 03:39:47,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:47,641 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 38 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:47,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 652 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-06 03:39:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 260. [2025-02-06 03:39:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 235 states have (on average 1.3148936170212766) internal successors, (309), 236 states have internal predecessors, (309), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 349 transitions. [2025-02-06 03:39:47,661 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 349 transitions. Word has length 135 [2025-02-06 03:39:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:47,662 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 349 transitions. [2025-02-06 03:39:47,662 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-02-06 03:39:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 349 transitions. [2025-02-06 03:39:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:47,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:47,664 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, 1, 1] [2025-02-06 03:39:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:39:47,664 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:47,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1236959658, now seen corresponding path program 1 times [2025-02-06 03:39:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326709780] [2025-02-06 03:39:47,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:47,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:47,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326709780] [2025-02-06 03:39:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326709780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:47,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:47,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807402550] [2025-02-06 03:39:47,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:47,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:47,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:47,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:47,821 INFO L87 Difference]: Start difference. First operand 260 states and 349 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 03:39:48,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:48,000 INFO L93 Difference]: Finished difference Result 712 states and 949 transitions. [2025-02-06 03:39:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:48,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:48,003 INFO L225 Difference]: With dead ends: 712 [2025-02-06 03:39:48,003 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 03:39:48,003 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-02-06 03:39:48,004 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 130 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:48,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 897 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 03:39:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 276. [2025-02-06 03:39:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 251 states have (on average 1.3187250996015936) internal successors, (331), 252 states have internal predecessors, (331), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:39:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 371 transitions. [2025-02-06 03:39:48,026 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 371 transitions. Word has length 137 [2025-02-06 03:39:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:48,026 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 371 transitions. [2025-02-06 03:39:48,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-02-06 03:39:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 371 transitions. [2025-02-06 03:39:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:48,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:48,027 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, 1, 1] [2025-02-06 03:39:48,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:39:48,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:48,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1645783883, now seen corresponding path program 1 times [2025-02-06 03:39:48,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:48,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33282849] [2025-02-06 03:39:48,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:48,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:48,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:48,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:48,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:48,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33282849] [2025-02-06 03:39:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33282849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:48,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100366390] [2025-02-06 03:39:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:48,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:48,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:48,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:48,605 INFO L87 Difference]: Start difference. First operand 276 states and 371 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-06 03:39:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:49,513 INFO L93 Difference]: Finished difference Result 949 states and 1267 transitions. [2025-02-06 03:39:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 03:39:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:49,516 INFO L225 Difference]: With dead ends: 949 [2025-02-06 03:39:49,517 INFO L226 Difference]: Without dead ends: 676 [2025-02-06 03:39:49,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 03:39:49,519 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 369 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:49,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 3056 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:39:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-02-06 03:39:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 359. [2025-02-06 03:39:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 316 states have (on average 1.3006329113924051) internal successors, (411), 318 states have internal predecessors, (411), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:39:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 481 transitions. [2025-02-06 03:39:49,554 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 481 transitions. Word has length 137 [2025-02-06 03:39:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:49,554 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 481 transitions. [2025-02-06 03:39:49,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-02-06 03:39:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 481 transitions. [2025-02-06 03:39:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:49,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:49,556 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, 1, 1] [2025-02-06 03:39:49,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:39:49,556 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:49,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash 321470273, now seen corresponding path program 1 times [2025-02-06 03:39:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121135249] [2025-02-06 03:39:49,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:49,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:49,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:49,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:49,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:50,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121135249] [2025-02-06 03:39:50,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121135249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:39:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001573035] [2025-02-06 03:39:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:50,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:39:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:50,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:39:50,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:39:50,418 INFO L87 Difference]: Start difference. First operand 359 states and 481 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 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-02-06 03:39:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:50,992 INFO L93 Difference]: Finished difference Result 423 states and 556 transitions. [2025-02-06 03:39:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:39:50,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:50,995 INFO L225 Difference]: With dead ends: 423 [2025-02-06 03:39:50,995 INFO L226 Difference]: Without dead ends: 421 [2025-02-06 03:39:50,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:39:50,996 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 503 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:50,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1110 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-06 03:39:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 375. [2025-02-06 03:39:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 332 states have (on average 1.2981927710843373) internal successors, (431), 334 states have internal predecessors, (431), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:39:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 501 transitions. [2025-02-06 03:39:51,029 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 501 transitions. Word has length 137 [2025-02-06 03:39:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:51,029 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 501 transitions. [2025-02-06 03:39:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 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-02-06 03:39:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2025-02-06 03:39:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:51,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:51,031 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, 1, 1] [2025-02-06 03:39:51,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:39:51,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:51,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:51,031 INFO L85 PathProgramCache]: Analyzing trace with hash 322393794, now seen corresponding path program 1 times [2025-02-06 03:39:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:51,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288185854] [2025-02-06 03:39:51,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:51,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:51,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:51,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288185854] [2025-02-06 03:39:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288185854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:39:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120036849] [2025-02-06 03:39:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:39:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:51,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:39:51,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:39:51,456 INFO L87 Difference]: Start difference. First operand 375 states and 501 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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-02-06 03:39:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:51,869 INFO L93 Difference]: Finished difference Result 1015 states and 1338 transitions. [2025-02-06 03:39:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:51,872 INFO L225 Difference]: With dead ends: 1015 [2025-02-06 03:39:51,872 INFO L226 Difference]: Without dead ends: 643 [2025-02-06 03:39:51,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:39:51,876 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 290 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:51,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 999 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-06 03:39:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 545. [2025-02-06 03:39:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 502 states have (on average 1.294820717131474) internal successors, (650), 504 states have internal predecessors, (650), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:39:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 720 transitions. [2025-02-06 03:39:51,912 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 720 transitions. Word has length 137 [2025-02-06 03:39:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:51,912 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 720 transitions. [2025-02-06 03:39:51,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 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-02-06 03:39:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 720 transitions. [2025-02-06 03:39:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:51,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:51,914 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, 1, 1] [2025-02-06 03:39:51,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:39:51,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1295719284, now seen corresponding path program 1 times [2025-02-06 03:39:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427237080] [2025-02-06 03:39:51,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:51,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:51,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:51,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:51,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427237080] [2025-02-06 03:39:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427237080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:52,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754881780] [2025-02-06 03:39:52,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:52,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:52,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:52,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:52,507 INFO L87 Difference]: Start difference. First operand 545 states and 720 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 03:39:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:53,220 INFO L93 Difference]: Finished difference Result 1220 states and 1608 transitions. [2025-02-06 03:39:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 03:39:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 137 [2025-02-06 03:39:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:53,223 INFO L225 Difference]: With dead ends: 1220 [2025-02-06 03:39:53,223 INFO L226 Difference]: Without dead ends: 678 [2025-02-06 03:39:53,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:39:53,224 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 638 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 788 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-06 03:39:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 520. [2025-02-06 03:39:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 477 states have (on average 1.2976939203354299) internal successors, (619), 479 states have internal predecessors, (619), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:39:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 689 transitions. [2025-02-06 03:39:53,265 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 689 transitions. Word has length 137 [2025-02-06 03:39:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:53,266 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 689 transitions. [2025-02-06 03:39:53,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-02-06 03:39:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 689 transitions. [2025-02-06 03:39:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:53,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:53,268 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, 1, 1] [2025-02-06 03:39:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:39:53,268 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash 886895059, now seen corresponding path program 1 times [2025-02-06 03:39:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387712291] [2025-02-06 03:39:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:53,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:53,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:53,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387712291] [2025-02-06 03:39:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387712291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671837478] [2025-02-06 03:39:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:53,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:53,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:53,597 INFO L87 Difference]: Start difference. First operand 520 states and 689 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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-02-06 03:39:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:53,938 INFO L93 Difference]: Finished difference Result 1322 states and 1735 transitions. [2025-02-06 03:39:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:39:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:53,941 INFO L225 Difference]: With dead ends: 1322 [2025-02-06 03:39:53,941 INFO L226 Difference]: Without dead ends: 805 [2025-02-06 03:39:53,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:53,942 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 467 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:53,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 695 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-02-06 03:39:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 502. [2025-02-06 03:39:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 459 states have (on average 1.2832244008714597) internal successors, (589), 461 states have internal predecessors, (589), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 03:39:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 659 transitions. [2025-02-06 03:39:53,980 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 659 transitions. Word has length 137 [2025-02-06 03:39:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:53,980 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 659 transitions. [2025-02-06 03:39:53,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 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-02-06 03:39:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 659 transitions. [2025-02-06 03:39:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:53,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:53,981 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, 1, 1] [2025-02-06 03:39:53,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:39:53,981 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:53,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:53,982 INFO L85 PathProgramCache]: Analyzing trace with hash -438824897, now seen corresponding path program 1 times [2025-02-06 03:39:53,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:53,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773206637] [2025-02-06 03:39:53,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:53,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:53,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:54,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:54,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:54,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773206637] [2025-02-06 03:39:54,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773206637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:54,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:39:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117460136] [2025-02-06 03:39:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:54,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:39:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:54,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:39:54,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:54,326 INFO L87 Difference]: Start difference. First operand 502 states and 659 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-02-06 03:39:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:54,464 INFO L93 Difference]: Finished difference Result 537 states and 698 transitions. [2025-02-06 03:39:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:54,466 INFO L225 Difference]: With dead ends: 537 [2025-02-06 03:39:54,466 INFO L226 Difference]: Without dead ends: 535 [2025-02-06 03:39:54,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:54,467 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 56 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:54,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 852 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-06 03:39:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 352. [2025-02-06 03:39:54,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 333 states have (on average 1.2882882882882882) internal successors, (429), 333 states have internal predecessors, (429), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2025-02-06 03:39:54,487 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 137 [2025-02-06 03:39:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:54,487 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2025-02-06 03:39:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-02-06 03:39:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2025-02-06 03:39:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:54,489 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, 1, 1] [2025-02-06 03:39:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:39:54,489 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:54,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1439562087, now seen corresponding path program 1 times [2025-02-06 03:39:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772283697] [2025-02-06 03:39:54,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:54,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:54,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:54,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772283697] [2025-02-06 03:39:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772283697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:39:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255355387] [2025-02-06 03:39:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:54,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:39:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:54,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:39:54,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:54,898 INFO L87 Difference]: Start difference. First operand 352 states and 459 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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-02-06 03:39:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:55,379 INFO L93 Difference]: Finished difference Result 800 states and 1042 transitions. [2025-02-06 03:39:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:55,382 INFO L225 Difference]: With dead ends: 800 [2025-02-06 03:39:55,382 INFO L226 Difference]: Without dead ends: 451 [2025-02-06 03:39:55,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:39:55,383 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 355 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:55,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1002 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-06 03:39:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 330. [2025-02-06 03:39:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.2765273311897105) internal successors, (397), 311 states have internal predecessors, (397), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 427 transitions. [2025-02-06 03:39:55,469 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 427 transitions. Word has length 137 [2025-02-06 03:39:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 427 transitions. [2025-02-06 03:39:55,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 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-02-06 03:39:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 427 transitions. [2025-02-06 03:39:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 03:39:55,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:55,470 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, 1, 1] [2025-02-06 03:39:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:39:55,471 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:55,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1694298632, now seen corresponding path program 1 times [2025-02-06 03:39:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818759365] [2025-02-06 03:39:55,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:55,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:55,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 03:39:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 03:39:55,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:55,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818759365] [2025-02-06 03:39:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818759365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:55,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:55,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:39:55,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130114868] [2025-02-06 03:39:55,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:55,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:39:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:55,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:39:55,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:55,908 INFO L87 Difference]: Start difference. First operand 330 states and 427 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-02-06 03:39:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:56,221 INFO L93 Difference]: Finished difference Result 786 states and 1009 transitions. [2025-02-06 03:39:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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 137 [2025-02-06 03:39:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:56,224 INFO L225 Difference]: With dead ends: 786 [2025-02-06 03:39:56,224 INFO L226 Difference]: Without dead ends: 459 [2025-02-06 03:39:56,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:39:56,225 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 123 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:56,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 2039 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-06 03:39:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 312. [2025-02-06 03:39:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 293 states have (on average 1.273037542662116) internal successors, (373), 293 states have internal predecessors, (373), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 403 transitions. [2025-02-06 03:39:56,256 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 403 transitions. Word has length 137 [2025-02-06 03:39:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:56,256 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 403 transitions. [2025-02-06 03:39:56,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-02-06 03:39:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 403 transitions. [2025-02-06 03:39:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:39:56,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:56,258 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, 1, 1, 1, 1] [2025-02-06 03:39:56,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:39:56,258 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1996947708, now seen corresponding path program 1 times [2025-02-06 03:39:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605441697] [2025-02-06 03:39:56,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:56,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:39:56,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:39:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:39:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:56,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605441697] [2025-02-06 03:39:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605441697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:56,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723681801] [2025-02-06 03:39:56,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:56,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:56,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:56,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:56,541 INFO L87 Difference]: Start difference. First operand 312 states and 403 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-02-06 03:39:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:56,648 INFO L93 Difference]: Finished difference Result 662 states and 852 transitions. [2025-02-06 03:39:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 139 [2025-02-06 03:39:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:56,649 INFO L225 Difference]: With dead ends: 662 [2025-02-06 03:39:56,649 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 03:39:56,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:56,650 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 62 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 631 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 03:39:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 312. [2025-02-06 03:39:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 293 states have (on average 1.2696245733788396) internal successors, (372), 293 states have internal predecessors, (372), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 402 transitions. [2025-02-06 03:39:56,669 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 402 transitions. Word has length 139 [2025-02-06 03:39:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:56,670 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 402 transitions. [2025-02-06 03:39:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-02-06 03:39:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 402 transitions. [2025-02-06 03:39:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 03:39:56,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:56,671 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, 1, 1, 1, 1] [2025-02-06 03:39:56,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:39:56,671 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:56,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash 220810245, now seen corresponding path program 1 times [2025-02-06 03:39:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:56,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274082263] [2025-02-06 03:39:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:39:56,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:39:56,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:39:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066388115] [2025-02-06 03:39:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:56,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:56,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:39:56,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:39:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:39:57,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:39:57,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:57,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:39:57,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 03:39:57,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 03:39:57,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:57,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:57,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:39:57,631 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:39:57,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:39:57,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:39:57,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 03:39:57,837 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:58,016 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:39:58,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:39:58 BoogieIcfgContainer [2025-02-06 03:39:58,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:39:58,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:39:58,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:39:58,023 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:39:58,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:30" (3/4) ... [2025-02-06 03:39:58,026 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:39:58,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:39:58,028 INFO L158 Benchmark]: Toolchain (without parser) took 29038.62ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 121.6MB in the beginning and 234.7MB in the end (delta: -113.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.39ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.93ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: Boogie Preprocessor took 72.89ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 98.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: IcfgBuilder took 684.20ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 56.8MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: TraceAbstraction took 27952.07ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 56.4MB in the beginning and 234.8MB in the end (delta: -178.4MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2025-02-06 03:39:58,028 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 302.0MB. Free memory was 234.8MB in the beginning and 234.7MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:58,029 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.30ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.39ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.93ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.89ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 98.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 684.20ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 56.8MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27952.07ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 56.4MB in the beginning and 234.8MB in the end (delta: -178.4MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 302.0MB. Free memory was 234.8MB in the beginning and 234.7MB in the end (delta: 87.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L22] unsigned short int var_1_1 = 5; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_3 = -25; [L24] signed short int var_1_3 = -25; [L25] signed short int* var_1_3_Pointer = &(var_1_3); [L26] unsigned short int var_1_7 = 4; [L26] unsigned short int var_1_7 = 4; [L27] unsigned short int* var_1_7_Pointer = &(var_1_7); [L28] unsigned char var_1_8 = 4; [L28] unsigned char var_1_8 = 4; [L29] unsigned char* var_1_8_Pointer = &(var_1_8); [L30] unsigned char var_1_10 = 4; [L30] unsigned char var_1_10 = 4; [L31] unsigned char* var_1_10_Pointer = &(var_1_10); [L32] unsigned char var_1_11 = 8; [L32] unsigned char var_1_11 = 8; [L33] unsigned char* var_1_11_Pointer = &(var_1_11); [L34] unsigned long int var_1_12 = 10; [L34] unsigned long int var_1_12 = 10; [L35] unsigned long int* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 99.6; [L36] float var_1_13 = 99.6; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 127.5; [L38] float var_1_14 = 127.5; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 16.5; [L40] float var_1_15 = 16.5; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.5; [L42] float var_1_16 = 256.5; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] unsigned long int var_1_17 = 4288034294; [L44] unsigned long int var_1_17 = 4288034294; [L45] unsigned long int* var_1_17_Pointer = &(var_1_17); [L46] unsigned char var_1_18 = 0; [L46] unsigned char var_1_18 = 0; [L47] unsigned char* var_1_18_Pointer = &(var_1_18); [L48] unsigned long int last_1_var_1_12 = 10; [L49] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR \read(var_1_12) [L100] last_1_var_1_12 = var_1_12 [L101] EXPR \read(var_1_18) [L101] last_1_var_1_18 = var_1_18 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L76] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L82] var_1_11 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L83] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L84] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L85] var_1_13 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F [L86] EXPR \read(var_1_13) [L86] EXPR var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] EXPR (var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L86] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L87] var_1_14 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F [L88] EXPR \read(var_1_14) [L88] EXPR var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] EXPR (var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L88] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F [L90] EXPR \read(var_1_15) [L90] EXPR var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] EXPR (var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L90] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L92] var_1_16 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F [L93] EXPR \read(var_1_16) [L93] EXPR var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] EXPR (var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L93] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L94] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L95] var_1_17 = __VERIFIER_nondet_ulong() [L96] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L97] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_3_Pointer) [L53] unsigned long int stepLocal_2 = last_1_var_1_12 / (*(var_1_3_Pointer)); [L54] COND TRUE stepLocal_2 != (last_1_var_1_18 - 64) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L55] EXPR \read(*var_1_10_Pointer) [L55] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L55] (*(var_1_8_Pointer)) = (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))) [L59] EXPR \read(*var_1_13_Pointer) [L59] EXPR \read(*var_1_14_Pointer) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L59] COND TRUE (- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer)))))) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) [L60] EXPR \read(*var_1_8_Pointer) [L60] EXPR (((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L60] (*(var_1_12_Pointer)) = (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))) [L64] EXPR \read(*var_1_11_Pointer) [L64] (*(var_1_18_Pointer)) = (*(var_1_11_Pointer)) [L65] EXPR \read(*var_1_18_Pointer) [L65] (*(var_1_7_Pointer)) = (*(var_1_18_Pointer)) [L66] EXPR \read(*var_1_3_Pointer) [L66] signed long int stepLocal_1 = - (*(var_1_3_Pointer)); [L67] EXPR \read(*var_1_7_Pointer) [L67] EXPR \read(*var_1_3_Pointer) [L67] signed long int stepLocal_0 = (*(var_1_7_Pointer)) / (*(var_1_3_Pointer)); [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L68] COND FALSE !(stepLocal_0 >= (*(var_1_7_Pointer))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 [L104] EXPR (((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_18_Pointer) [L104] EXPR ((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) [L104] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR (((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)))))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) [L104] EXPR \read(*var_1_13_Pointer) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR (((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_12_Pointer) [L104] EXPR \read(*var_1_17_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR ((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer)))))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104] EXPR (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L104-L105] return (((((((*(var_1_7_Pointer)) / (*(var_1_3_Pointer))) >= (*(var_1_7_Pointer))) ? (((- (*(var_1_3_Pointer))) > (*(var_1_7_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_8_Pointer))) < ((*(var_1_18_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_18_Pointer))))))) : 1) : 1) && ((*(var_1_7_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && (((last_1_var_1_12 / (*(var_1_3_Pointer))) != (last_1_var_1_18 - 64)) ? ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_10_Pointer))) > ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : ((*(var_1_8_Pointer)) == ((unsigned char) (((((*(var_1_11_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))))) && (((- ((*(var_1_13_Pointer)) / 0.6f)) > (((*(var_1_14_Pointer)) + 3.25f) / (((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))))) ? ((*(var_1_12_Pointer)) == ((unsigned long int) (500u + (((((*(var_1_10_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_8_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned long int) ((*(var_1_17_Pointer)) - (*(var_1_10_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_11_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_7={6:0}, var_1_7_Pointer={6:0}, var_1_8={7:0}, var_1_8_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.7s, OverallIterations: 29, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6354 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6354 mSDsluCounter, 25955 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21044 mSDsCounter, 781 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6863 IncrementalHoareTripleChecker+Invalid, 7644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 781 mSolverCounterUnsat, 4911 mSDtfsCounter, 6863 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 504 SyntacticMatches, 3 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=22, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 2021 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 4437 NumberOfCodeBlocks, 4437 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4128 ConstructedInterpolants, 0 QuantifiedInterpolants, 15987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1706 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 31 InterpolantComputations, 28 PerfectInterpolantSequences, 12926/13020 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-02-06 03:39:58,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:59,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:59,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:39:59,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:59,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:40:00,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:40:00,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:40:00,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:40:00,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:40:00,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:40:00,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:40:00,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:40:00,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:40:00,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:40:00,010 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:40:00,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:40:00,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:40:00,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:00,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:40:00,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:40:00,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4b2a28a2509ad3d68be39a714508322f11f55ff3b91cb7a6ce10ff6c38462d6 [2025-02-06 03:40:00,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:40:00,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:40:00,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:40:00,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:40:00,259 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:40:00,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:40:01,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e5e410a/72c442a50fd740459ac052bb464981a2/FLAG6b88d8792 [2025-02-06 03:40:01,649 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:40:01,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:40:01,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e5e410a/72c442a50fd740459ac052bb464981a2/FLAG6b88d8792 [2025-02-06 03:40:02,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a6e5e410a/72c442a50fd740459ac052bb464981a2 [2025-02-06 03:40:02,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:40:02,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:40:02,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:02,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:40:02,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:40:02,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365b4408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02, skipping insertion in model container [2025-02-06 03:40:02,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:40:02,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2025-02-06 03:40:02,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:02,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:40:02,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-4.i[915,928] [2025-02-06 03:40:02,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:40:02,236 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:40:02,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02 WrapperNode [2025-02-06 03:40:02,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:40:02,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:02,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:40:02,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:40:02,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,283 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-02-06 03:40:02,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:40:02,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:40:02,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:40:02,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:40:02,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,337 INFO L175 MemorySlicer]: Split 130 memory accesses to 14 slices as follows [2, 3, 11, 9, 13, 18, 14, 6, 8, 8, 11, 11, 6, 10]. 14 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:40:02,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:40:02,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:40:02,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:40:02,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:40:02,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (1/1) ... [2025-02-06 03:40:02,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:40:02,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:40:02,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:40:02,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:40:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:40:02,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:40:02,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:40:02,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:40:02,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:40:02,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:40:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:40:02,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:40:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:40:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:40:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:40:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:40:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:40:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:40:02,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:40:02,627 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:40:19,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:40:19,317 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-02-06 03:40:19,317 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:40:19,329 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:40:19,330 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:40:19,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:19 BoogieIcfgContainer [2025-02-06 03:40:19,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:40:19,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:40:19,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:40:19,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:40:19,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:40:02" (1/3) ... [2025-02-06 03:40:19,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3fed35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:19, skipping insertion in model container [2025-02-06 03:40:19,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:40:02" (2/3) ... [2025-02-06 03:40:19,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3fed35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:40:19, skipping insertion in model container [2025-02-06 03:40:19,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:40:19" (3/3) ... [2025-02-06 03:40:19,337 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-4.i [2025-02-06 03:40:19,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:40:19,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-4.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:40:19,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:40:19,398 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;@2f72995c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:40:19,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:40:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 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-02-06 03:40:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:40:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:19,408 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] [2025-02-06 03:40:19,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -179533020, now seen corresponding path program 1 times [2025-02-06 03:40:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904412691] [2025-02-06 03:40:19,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:19,419 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-02-06 03:40:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:19,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:19,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 03:40:19,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:40:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:40:20,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:20,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:40:20,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-02-06 03:40:20,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:20,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904412691] [2025-02-06 03:40:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904412691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:40:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579675468] [2025-02-06 03:40:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:20,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:40:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:40:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:40:20,076 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02-06 03:40:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:20,094 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2025-02-06 03:40:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:40:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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 130 [2025-02-06 03:40:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:20,099 INFO L225 Difference]: With dead ends: 212 [2025-02-06 03:40:20,099 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:40:20,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:40:20,102 INFO L435 NwaCegarLoop]: 154 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, 154 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-02-06 03:40:20,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:40:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:40:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-06 03:40:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 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-02-06 03:40:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-02-06 03:40:20,126 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2025-02-06 03:40:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-02-06 03:40:20,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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-02-06 03:40:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-02-06 03:40:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:40:20,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:20,130 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] [2025-02-06 03:40:20,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:40:20,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:20,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -431844915, now seen corresponding path program 1 times [2025-02-06 03:40:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202597040] [2025-02-06 03:40:20,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:20,336 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-02-06 03:40:20,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:20,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:20,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 03:40:20,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:40:20,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:40:20,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:20,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:20,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:40:20,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:40:21,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:21,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202597040] [2025-02-06 03:40:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202597040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017850378] [2025-02-06 03:40:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:21,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:21,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:21,104 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 03:40:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:21,235 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2025-02-06 03:40:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 130 [2025-02-06 03:40:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:21,237 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:40:21,237 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:40:21,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:21,238 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:21,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:21,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:40:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-02-06 03:40:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 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-02-06 03:40:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-02-06 03:40:21,245 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2025-02-06 03:40:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-02-06 03:40:21,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 03:40:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-02-06 03:40:21,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:40:21,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:21,247 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] [2025-02-06 03:40:21,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:21,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:21,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:21,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -430921394, now seen corresponding path program 1 times [2025-02-06 03:40:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:21,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276597146] [2025-02-06 03:40:21,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:21,449 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-02-06 03:40:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:21,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:21,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 03:40:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:40:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:40:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:22,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:40:22,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:22,104 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 18 treesize of output 14 [2025-02-06 03:40:22,189 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-02-06 03:40:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:40:22,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:22,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276597146] [2025-02-06 03:40:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276597146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102180959] [2025-02-06 03:40:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:22,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:22,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:22,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:22,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:22,252 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 03:40:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:22,607 INFO L93 Difference]: Finished difference Result 287 states and 416 transitions. [2025-02-06 03:40:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 130 [2025-02-06 03:40:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:22,614 INFO L225 Difference]: With dead ends: 287 [2025-02-06 03:40:22,614 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 03:40:22,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:40:22,615 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 148 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:22,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 814 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:40:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 03:40:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 112. [2025-02-06 03:40:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 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-02-06 03:40:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-02-06 03:40:22,625 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 130 [2025-02-06 03:40:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-02-06 03:40:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-02-06 03:40:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-02-06 03:40:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:40:22,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:22,626 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] [2025-02-06 03:40:22,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:40:22,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:22,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:22,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2067094543, now seen corresponding path program 1 times [2025-02-06 03:40:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049040513] [2025-02-06 03:40:22,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:22,828 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-02-06 03:40:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:22,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:22,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 03:40:22,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:40:23,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:40:23,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:23,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:23,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:40:23,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:40:23,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:23,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049040513] [2025-02-06 03:40:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049040513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:40:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910434781] [2025-02-06 03:40:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:40:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:23,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:40:23,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:40:23,479 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:40:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:23,548 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2025-02-06 03:40:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:40:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 130 [2025-02-06 03:40:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:23,550 INFO L225 Difference]: With dead ends: 223 [2025-02-06 03:40:23,550 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:40:23,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 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-02-06 03:40:23,551 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:23,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:40:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-06 03:40:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 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-02-06 03:40:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-02-06 03:40:23,556 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 130 [2025-02-06 03:40:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:23,559 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-02-06 03:40:23,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-02-06 03:40:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-02-06 03:40:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:40:23,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:23,560 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] [2025-02-06 03:40:23,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:40:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:23,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:23,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1343112681, now seen corresponding path program 1 times [2025-02-06 03:40:23,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125980701] [2025-02-06 03:40:23,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:23,765 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-02-06 03:40:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:23,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:23,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:40:23,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:40:24,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:40:24,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:24,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:24,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:40:24,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:40:24,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:24,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125980701] [2025-02-06 03:40:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125980701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:40:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:40:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541319504] [2025-02-06 03:40:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:24,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:24,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:24,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:24,428 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 03:40:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:24,543 INFO L93 Difference]: Finished difference Result 228 states and 325 transitions. [2025-02-06 03:40:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 132 [2025-02-06 03:40:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:24,545 INFO L225 Difference]: With dead ends: 228 [2025-02-06 03:40:24,545 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 03:40:24,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:40:24,546 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:24,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 03:40:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-02-06 03:40:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 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-02-06 03:40:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-02-06 03:40:24,552 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 132 [2025-02-06 03:40:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:24,553 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-02-06 03:40:24,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-02-06 03:40:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-02-06 03:40:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 03:40:24,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:24,554 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] [2025-02-06 03:40:24,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:40:24,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:24,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:24,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash -153265237, now seen corresponding path program 1 times [2025-02-06 03:40:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823359299] [2025-02-06 03:40:24,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:24,756 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-02-06 03:40:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:24,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:24,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:40:24,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 03:40:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 03:40:25,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:25,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:25,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:40:25,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:26,571 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 17 [2025-02-06 03:40:26,727 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-02-06 03:40:27,048 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 21 [2025-02-06 03:40:27,089 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-02-06 03:40:27,262 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 18 treesize of output 14 [2025-02-06 03:40:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 140 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 03:40:30,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:40:32,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:32,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823359299] [2025-02-06 03:40:32,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823359299] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:32,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2025-02-06 03:40:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444677493] [2025-02-06 03:40:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:40:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:32,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:40:32,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:40:32,737 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-02-06 03:40:39,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:40:43,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:40:47,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:40:48,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []