./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:08,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:08,509 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:08,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:08,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:08,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:08,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:08,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:08,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:08,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:08,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:08,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:08,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:08,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:08,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:08,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:08,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:08,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:08,529 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2025-02-06 03:39:08,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:08,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:08,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:08,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:08,721 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:08,722 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-37.i [2025-02-06 03:39:09,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69760cd1c/a3c8b1b463374eb38fc09be782dc1cbf/FLAG0ce17becf [2025-02-06 03:39:10,230 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:10,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-02-06 03:39:10,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69760cd1c/a3c8b1b463374eb38fc09be782dc1cbf/FLAG0ce17becf [2025-02-06 03:39:10,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69760cd1c/a3c8b1b463374eb38fc09be782dc1cbf [2025-02-06 03:39:10,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:10,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:10,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:10,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:10,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:10,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:10" (1/1) ... [2025-02-06 03:39:10,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149051e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:10, skipping insertion in model container [2025-02-06 03:39:10,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:10" (1/1) ... [2025-02-06 03:39:10,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:10,416 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-37.i[916,929] [2025-02-06 03:39:10,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:10,466 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:10,474 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-37.i[916,929] [2025-02-06 03:39:10,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:10,524 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:10,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:10 WrapperNode [2025-02-06 03:39:10,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:10,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:10,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:10,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:10,530 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:10" (1/1) ... [2025-02-06 03:39:10,539 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:10" (1/1) ... [2025-02-06 03:39:10,573 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-02-06 03:39:10,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:10,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:10,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:10,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:10,584 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:10" (1/1) ... [2025-02-06 03:39:10,584 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:10" (1/1) ... [2025-02-06 03:39:10,587 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:10" (1/1) ... [2025-02-06 03:39:10,621 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-02-06 03:39:10,621 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:10" (1/1) ... [2025-02-06 03:39:10,621 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:10" (1/1) ... [2025-02-06 03:39:10,643 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:10" (1/1) ... [2025-02-06 03:39:10,647 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:10" (1/1) ... [2025-02-06 03:39:10,650 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:10" (1/1) ... [2025-02-06 03:39:10,655 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:10" (1/1) ... [2025-02-06 03:39:10,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:10,662 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:10,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:10,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:10,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:10" (1/1) ... [2025-02-06 03:39:10,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:10,694 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:10,704 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:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:39:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:39:10,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:39:10,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:39:10,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:39:10,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:39:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:39:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:10,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:39:10,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:10,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:10,869 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:10,870 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:11,252 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~bitwise75#1;havoc property_#t~ite80#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem78#1;havoc property_#t~mem85#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~ite116#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite113#1;havoc property_#t~mem109#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem112#1;havoc property_#t~short117#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short120#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-02-06 03:39:11,290 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:11,290 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:11,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:11,311 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:11,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:11 BoogieIcfgContainer [2025-02-06 03:39:11,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:11,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:11,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:11,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:11,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:10" (1/3) ... [2025-02-06 03:39:11,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a0785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:11, skipping insertion in model container [2025-02-06 03:39:11,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:10" (2/3) ... [2025-02-06 03:39:11,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a0785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:11, skipping insertion in model container [2025-02-06 03:39:11,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:11" (3/3) ... [2025-02-06 03:39:11,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2025-02-06 03:39:11,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:11,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-37.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:11,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:11,416 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;@774df969, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:11,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:11,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:11,429 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:11,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1525067906, now seen corresponding path program 1 times [2025-02-06 03:39:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025447337] [2025-02-06 03:39:11,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:11,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:11,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:11,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:11,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:11,665 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:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025447337] [2025-02-06 03:39:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025447337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449347128] [2025-02-06 03:39:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:11,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:11,669 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:11,671 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:11,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:11,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:11,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:11,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:11,898 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:11,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449347128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:39:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432478691] [2025-02-06 03:39:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:11,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:11,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:11,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:11,915 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 87 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:11,937 INFO L93 Difference]: Finished difference Result 202 states and 314 transitions. [2025-02-06 03:39:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-06 03:39:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:11,942 INFO L225 Difference]: With dead ends: 202 [2025-02-06 03:39:11,942 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:39:11,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:11,946 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:11,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:39:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-06 03:39:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2025-02-06 03:39:11,970 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 124 [2025-02-06 03:39:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:11,970 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2025-02-06 03:39:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2025-02-06 03:39:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:11,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:11,973 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:11,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:12,174 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:12,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 362558503, now seen corresponding path program 1 times [2025-02-06 03:39:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531124367] [2025-02-06 03:39:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:12,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:12,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:12,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:12,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:12,440 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:12,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:12,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531124367] [2025-02-06 03:39:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531124367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339231864] [2025-02-06 03:39:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:12,442 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:12,482 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2025-02-06 03:39:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-06 03:39:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:12,484 INFO L225 Difference]: With dead ends: 201 [2025-02-06 03:39:12,484 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 03:39:12,484 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:12,485 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:12,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 03:39:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 03:39:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2025-02-06 03:39:12,491 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 124 [2025-02-06 03:39:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:12,492 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2025-02-06 03:39:12,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2025-02-06 03:39:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:12,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:12,494 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:39:12,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1608380954, now seen corresponding path program 1 times [2025-02-06 03:39:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983708238] [2025-02-06 03:39:12,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:12,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:12,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:12,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:12,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:12,650 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:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983708238] [2025-02-06 03:39:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983708238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731896208] [2025-02-06 03:39:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:12,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:12,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:12,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:12,652 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:12,683 INFO L93 Difference]: Finished difference Result 206 states and 299 transitions. [2025-02-06 03:39:12,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:12,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 03:39:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:12,685 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:39:12,687 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:39:12,688 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:12,688 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:12,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:39:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 03:39:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-02-06 03:39:12,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 124 [2025-02-06 03:39:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:12,695 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-02-06 03:39:12,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-02-06 03:39:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:12,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:12,696 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:39:12,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 879131879, now seen corresponding path program 1 times [2025-02-06 03:39:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132420381] [2025-02-06 03:39:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:12,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:12,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:12,824 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:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132420381] [2025-02-06 03:39:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132420381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:12,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032846619] [2025-02-06 03:39:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:12,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:12,826 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:12,849 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-02-06 03:39:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 03:39:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:12,851 INFO L225 Difference]: With dead ends: 210 [2025-02-06 03:39:12,851 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:39:12,851 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:12,851 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:12,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:39:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-06 03:39:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-02-06 03:39:12,857 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 124 [2025-02-06 03:39:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:12,857 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-02-06 03:39:12,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-02-06 03:39:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:12,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:12,859 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:39:12,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1766635560, now seen corresponding path program 1 times [2025-02-06 03:39:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545200028] [2025-02-06 03:39:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:12,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:12,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:12,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:12,990 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:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545200028] [2025-02-06 03:39:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545200028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196843280] [2025-02-06 03:39:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:12,993 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:13,022 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2025-02-06 03:39:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 03:39:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:13,024 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:39:13,025 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 03:39:13,025 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:13,025 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 03:39:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-02-06 03:39:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-02-06 03:39:13,036 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 124 [2025-02-06 03:39:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:13,037 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-02-06 03:39:13,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-02-06 03:39:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:39:13,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:13,041 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:39:13,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:13,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1767559081, now seen corresponding path program 1 times [2025-02-06 03:39:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171890872] [2025-02-06 03:39:13,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:39:13,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:39:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:13,799 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:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171890872] [2025-02-06 03:39:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171890872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:13,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:13,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:13,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841397390] [2025-02-06 03:39:13,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:13,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:13,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:13,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:13,801 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-06 03:39:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:13,976 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2025-02-06 03:39:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 124 [2025-02-06 03:39:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:13,978 INFO L225 Difference]: With dead ends: 229 [2025-02-06 03:39:13,980 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 03:39:13,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:13,981 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 313 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:13,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 587 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 03:39:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-02-06 03:39:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:39:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2025-02-06 03:39:13,993 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 124 [2025-02-06 03:39:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:13,993 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2025-02-06 03:39:13,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-06 03:39:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2025-02-06 03:39:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:39:13,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:13,997 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:39:13,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1551241273, now seen corresponding path program 1 times [2025-02-06 03:39:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307786833] [2025-02-06 03:39:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307786833] [2025-02-06 03:39:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307786833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524206839] [2025-02-06 03:39:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:14,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:14,983 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:14,984 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:15,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:15,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:15,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:15,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:39:15,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:15,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:15,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 03:39:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 03:39:15,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:15,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-02-06 03:39:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524206839] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:39:15,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:39:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2025-02-06 03:39:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028636588] [2025-02-06 03:39:15,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:15,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:39:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:15,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:39:15,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:39:15,687 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) [2025-02-06 03:39:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:16,450 INFO L93 Difference]: Finished difference Result 248 states and 337 transitions. [2025-02-06 03:39:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 03:39:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) Word has length 127 [2025-02-06 03:39:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:16,453 INFO L225 Difference]: With dead ends: 248 [2025-02-06 03:39:16,453 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 03:39:16,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:39:16,454 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 436 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:16,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 815 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 03:39:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2025-02-06 03:39:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.2844036697247707) internal successors, (140), 110 states have internal predecessors, (140), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:39:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2025-02-06 03:39:16,467 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 127 [2025-02-06 03:39:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:16,467 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2025-02-06 03:39:16,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 7 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (45), 5 states have call predecessors, (45), 7 states have call successors, (45) [2025-02-06 03:39:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2025-02-06 03:39:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:39:16,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:16,468 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:16,476 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:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:16,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1296504728, now seen corresponding path program 1 times [2025-02-06 03:39:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53053214] [2025-02-06 03:39:16,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:16,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:16,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:16,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:16,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:16,781 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:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53053214] [2025-02-06 03:39:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53053214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155136664] [2025-02-06 03:39:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:16,782 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:16,863 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2025-02-06 03:39:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-02-06 03:39:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:16,865 INFO L225 Difference]: With dead ends: 291 [2025-02-06 03:39:16,865 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:39:16,865 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:16,866 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 128 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:16,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 596 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:39:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-02-06 03:39:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 134 states have internal predecessors, (166), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2025-02-06 03:39:16,883 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 127 [2025-02-06 03:39:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:16,883 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2025-02-06 03:39:16,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2025-02-06 03:39:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:39:16,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:16,884 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:16,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:39:16,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:16,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1490910759, now seen corresponding path program 1 times [2025-02-06 03:39:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:16,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966885259] [2025-02-06 03:39:16,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:16,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:16,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966885259] [2025-02-06 03:39:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966885259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133729815] [2025-02-06 03:39:17,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:17,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:17,560 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:17,563 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:17,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:17,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:39:17,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:17,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:18,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:18,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-02-06 03:39:18,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:18,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 03:39:18,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 03:39:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 5 proven. 231 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:39:18,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:18,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-02-06 03:39:18,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-02-06 03:39:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133729815] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:39:18,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:39:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-02-06 03:39:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906862939] [2025-02-06 03:39:18,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 03:39:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:18,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 03:39:18,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:39:18,897 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) [2025-02-06 03:39:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:19,890 INFO L93 Difference]: Finished difference Result 307 states and 400 transitions. [2025-02-06 03:39:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 03:39:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) Word has length 127 [2025-02-06 03:39:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:19,893 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:39:19,893 INFO L226 Difference]: Without dead ends: 189 [2025-02-06 03:39:19,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=1783, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 03:39:19,894 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 606 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:19,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 878 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-06 03:39:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2025-02-06 03:39:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 118 states have internal predecessors, (146), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2025-02-06 03:39:19,909 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 127 [2025-02-06 03:39:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:19,910 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2025-02-06 03:39:19,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 27 states have internal predecessors, (112), 9 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (45), 7 states have call predecessors, (45), 9 states have call successors, (45) [2025-02-06 03:39:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2025-02-06 03:39:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:39:19,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:19,911 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:19,921 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:20,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:20,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:20,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1459890952, now seen corresponding path program 1 times [2025-02-06 03:39:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351406158] [2025-02-06 03:39:20,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:20,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:20,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:20,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:20,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:20,641 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:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:20,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351406158] [2025-02-06 03:39:20,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351406158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131912111] [2025-02-06 03:39:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:20,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:20,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:20,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:20,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:20,643 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-06 03:39:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:21,066 INFO L93 Difference]: Finished difference Result 295 states and 387 transitions. [2025-02-06 03:39:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:39:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2025-02-06 03:39:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:21,068 INFO L225 Difference]: With dead ends: 295 [2025-02-06 03:39:21,068 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:39:21,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:39:21,069 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 542 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:21,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 721 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:39:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 146. [2025-02-06 03:39:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:39:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2025-02-06 03:39:21,081 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 127 [2025-02-06 03:39:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:21,081 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2025-02-06 03:39:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-06 03:39:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2025-02-06 03:39:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:39:21,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:21,082 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:21,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:39:21,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1965449577, now seen corresponding path program 1 times [2025-02-06 03:39:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:21,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275677067] [2025-02-06 03:39:21,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:21,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:39:21,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:39:21,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:21,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:21,252 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:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275677067] [2025-02-06 03:39:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275677067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763027043] [2025-02-06 03:39:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:21,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:21,254 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:21,335 INFO L93 Difference]: Finished difference Result 283 states and 363 transitions. [2025-02-06 03:39:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:21,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2025-02-06 03:39:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:21,336 INFO L225 Difference]: With dead ends: 283 [2025-02-06 03:39:21,336 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 03:39:21,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:21,337 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 99 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:21,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 700 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 03:39:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-02-06 03:39:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.216) internal successors, (152), 126 states have internal predecessors, (152), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:39:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2025-02-06 03:39:21,349 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 127 [2025-02-06 03:39:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:21,349 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2025-02-06 03:39:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2025-02-06 03:39:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:39:21,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:21,350 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:21,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:39:21,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 834955122, now seen corresponding path program 1 times [2025-02-06 03:39:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361951416] [2025-02-06 03:39:21,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:21,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:39:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:39:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:21,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:22,382 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:22,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:22,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361951416] [2025-02-06 03:39:22,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361951416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:22,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:39:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679350185] [2025-02-06 03:39:22,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:22,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:39:22,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:22,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:39:22,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:39:22,385 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:39:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:23,030 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2025-02-06 03:39:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:39:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-02-06 03:39:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:23,032 INFO L225 Difference]: With dead ends: 235 [2025-02-06 03:39:23,034 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 03:39:23,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:39:23,034 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 448 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:23,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1044 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 03:39:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2025-02-06 03:39:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 173 states have (on average 1.1791907514450868) internal successors, (204), 175 states have internal predecessors, (204), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:39:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 284 transitions. [2025-02-06 03:39:23,060 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 284 transitions. Word has length 129 [2025-02-06 03:39:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 284 transitions. [2025-02-06 03:39:23,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:39:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 284 transitions. [2025-02-06 03:39:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:39:23,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:23,065 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:23,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:39:23,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:23,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash 835878643, now seen corresponding path program 1 times [2025-02-06 03:39:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:23,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88487615] [2025-02-06 03:39:23,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:39:23,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:39:23,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:23,266 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:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:23,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88487615] [2025-02-06 03:39:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88487615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872689021] [2025-02-06 03:39:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:23,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:23,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:23,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:23,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:23,270 INFO L87 Difference]: Start difference. First operand 229 states and 284 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:23,349 INFO L93 Difference]: Finished difference Result 442 states and 551 transitions. [2025-02-06 03:39:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:39:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:23,352 INFO L225 Difference]: With dead ends: 442 [2025-02-06 03:39:23,352 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 03:39:23,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:23,353 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 115 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:23,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 635 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 03:39:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 184. [2025-02-06 03:39:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2025-02-06 03:39:23,392 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 129 [2025-02-06 03:39:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2025-02-06 03:39:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2025-02-06 03:39:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:39:23,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:23,395 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:23,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:39:23,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:23,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1723382324, now seen corresponding path program 1 times [2025-02-06 03:39:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:23,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424283214] [2025-02-06 03:39:23,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:39:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:39:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:23,555 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:23,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:23,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424283214] [2025-02-06 03:39:23,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424283214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:23,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:23,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:23,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734742843] [2025-02-06 03:39:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:23,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:23,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:23,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:23,557 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:23,636 INFO L93 Difference]: Finished difference Result 311 states and 393 transitions. [2025-02-06 03:39:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:23,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:39:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:23,638 INFO L225 Difference]: With dead ends: 311 [2025-02-06 03:39:23,639 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 03:39:23,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:23,640 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 81 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:23,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 462 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 03:39:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-06 03:39:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 143 states have (on average 1.1958041958041958) internal successors, (171), 144 states have internal predecessors, (171), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2025-02-06 03:39:23,667 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 129 [2025-02-06 03:39:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2025-02-06 03:39:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2025-02-06 03:39:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:39:23,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:23,669 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:39:23,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash -84072139, now seen corresponding path program 1 times [2025-02-06 03:39:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730051305] [2025-02-06 03:39:23,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:23,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:39:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:39:23,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:23,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:24,078 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:24,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730051305] [2025-02-06 03:39:24,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730051305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:24,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:24,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:24,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313932213] [2025-02-06 03:39:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:24,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:24,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:24,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:24,081 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:24,235 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions. [2025-02-06 03:39:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:39:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:24,237 INFO L225 Difference]: With dead ends: 384 [2025-02-06 03:39:24,239 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 03:39:24,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:24,240 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 65 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:24,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 708 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 03:39:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 201. [2025-02-06 03:39:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.20625) internal successors, (193), 161 states have internal predecessors, (193), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 253 transitions. [2025-02-06 03:39:24,272 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 253 transitions. Word has length 129 [2025-02-06 03:39:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:24,273 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 253 transitions. [2025-02-06 03:39:24,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 253 transitions. [2025-02-06 03:39:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:39:24,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:24,274 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:24,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:39:24,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:24,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash 62796034, now seen corresponding path program 1 times [2025-02-06 03:39:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047949845] [2025-02-06 03:39:24,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:24,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:24,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:39:24,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:39:24,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:24,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:24,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:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047949845] [2025-02-06 03:39:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047949845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:39:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848393296] [2025-02-06 03:39:24,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:24,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:24,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:24,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:24,520 INFO L87 Difference]: Start difference. First operand 201 states and 253 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:24,655 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2025-02-06 03:39:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-06 03:39:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:24,658 INFO L225 Difference]: With dead ends: 345 [2025-02-06 03:39:24,658 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 03:39:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:24,658 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 204 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 313 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 03:39:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-06 03:39:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.2) internal successors, (192), 161 states have internal predecessors, (192), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:39:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2025-02-06 03:39:24,683 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 131 [2025-02-06 03:39:24,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:24,683 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2025-02-06 03:39:24,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2025-02-06 03:39:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:39:24,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:24,684 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:24,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:39:24,684 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:24,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -4210719, now seen corresponding path program 1 times [2025-02-06 03:39:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247902079] [2025-02-06 03:39:24,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:24,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:39:24,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:39:24,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247902079] [2025-02-06 03:39:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247902079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290650301] [2025-02-06 03:39:25,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:25,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:25,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:25,212 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:25,215 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:25,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:39:25,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:39:25,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:25,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:25,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 03:39:25,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:25,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:25,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:26,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:39:26,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 03:39:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 290 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-06 03:39:26,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:26,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2025-02-06 03:39:27,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 94 [2025-02-06 03:39:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 24 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-06 03:39:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290650301] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:39:27,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:39:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 40 [2025-02-06 03:39:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284899866] [2025-02-06 03:39:27,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 03:39:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:27,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 03:39:27,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 03:39:27,358 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) [2025-02-06 03:39:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:28,594 INFO L93 Difference]: Finished difference Result 375 states and 457 transitions. [2025-02-06 03:39:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:39:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) Word has length 131 [2025-02-06 03:39:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:28,596 INFO L225 Difference]: With dead ends: 375 [2025-02-06 03:39:28,596 INFO L226 Difference]: Without dead ends: 231 [2025-02-06 03:39:28,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=762, Invalid=3144, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 03:39:28,598 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 599 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:28,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1290 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:39:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-06 03:39:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 213. [2025-02-06 03:39:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.1823529411764706) internal successors, (201), 171 states have internal predecessors, (201), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2025-02-06 03:39:28,623 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 131 [2025-02-06 03:39:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2025-02-06 03:39:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 3.742857142857143) internal successors, (131), 37 states have internal predecessors, (131), 13 states have call successors, (39), 6 states have call predecessors, (39), 9 states have return successors, (39), 9 states have call predecessors, (39), 13 states have call successors, (39) [2025-02-06 03:39:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2025-02-06 03:39:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:39:28,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:28,625 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:28,636 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:28,825 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,SelfDestructingSolverStorable16 [2025-02-06 03:39:28,826 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:28,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2052935537, now seen corresponding path program 1 times [2025-02-06 03:39:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776764844] [2025-02-06 03:39:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:28,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:39:28,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:39:28,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776764844] [2025-02-06 03:39:28,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776764844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406110255] [2025-02-06 03:39:28,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:28,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:28,959 INFO L229 MonitoredProcess]: Starting monitored process 6 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:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:39:29,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:39:29,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:39:29,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:29,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:29,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:39:29,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:29,196 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:29,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406110255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:39:29,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584327023] [2025-02-06 03:39:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:29,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:29,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:29,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:29,199 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:29,246 INFO L93 Difference]: Finished difference Result 373 states and 451 transitions. [2025-02-06 03:39:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-02-06 03:39:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:29,247 INFO L225 Difference]: With dead ends: 373 [2025-02-06 03:39:29,247 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 03:39:29,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:39:29,248 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:29,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 656 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 03:39:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2025-02-06 03:39:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 172 states have internal predecessors, (202), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 258 transitions. [2025-02-06 03:39:29,275 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 258 transitions. Word has length 133 [2025-02-06 03:39:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 258 transitions. [2025-02-06 03:39:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 258 transitions. [2025-02-06 03:39:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:39:29,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:29,277 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:29,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:39:29,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 03:39:29,481 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2099785062, now seen corresponding path program 1 times [2025-02-06 03:39:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837630348] [2025-02-06 03:39:29,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:29,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:29,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:39:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718890908] [2025-02-06 03:39:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:29,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:29,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:29,569 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:39:29,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:29,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:29,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:29,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:29,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 03:39:29,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:30,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:30,327 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 03:39:30,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2025-02-06 03:39:30,395 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:39:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:39:30,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:30,552 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:30,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837630348] [2025-02-06 03:39:30,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:39:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718890908] [2025-02-06 03:39:30,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718890908] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:30,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:30,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-06 03:39:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885170726] [2025-02-06 03:39:30,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:30,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:30,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:30,556 INFO L87 Difference]: Start difference. First operand 214 states and 258 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:30,755 INFO L93 Difference]: Finished difference Result 470 states and 571 transitions. [2025-02-06 03:39:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:30,755 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:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:30,758 INFO L225 Difference]: With dead ends: 470 [2025-02-06 03:39:30,758 INFO L226 Difference]: Without dead ends: 313 [2025-02-06 03:39:30,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:30,758 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:30,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 548 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-06 03:39:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 220. [2025-02-06 03:39:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 177 states have (on average 1.1864406779661016) internal successors, (210), 178 states have internal predecessors, (210), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2025-02-06 03:39:30,788 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 135 [2025-02-06 03:39:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:30,789 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2025-02-06 03:39:30,790 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:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2025-02-06 03:39:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:39:30,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:30,792 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:30,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:39:30,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:30,992 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2068765255, now seen corresponding path program 1 times [2025-02-06 03:39:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034199396] [2025-02-06 03:39:30,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:31,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:31,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:31,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:39:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654881381] [2025-02-06 03:39:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:31,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:31,054 INFO L229 MonitoredProcess]: Starting monitored process 8 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:31,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:39:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:31,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:31,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:31,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:31,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:39:31,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:31,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:31,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:31,629 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:39:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:39:31,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:31,825 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,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034199396] [2025-02-06 03:39:31,825 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:39:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654881381] [2025-02-06 03:39:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654881381] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-02-06 03:39:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52052205] [2025-02-06 03:39:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:31,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:31,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:31,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:31,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:39:31,827 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:32,016 INFO L93 Difference]: Finished difference Result 457 states and 552 transitions. [2025-02-06 03:39:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:32,016 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:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:32,018 INFO L225 Difference]: With dead ends: 457 [2025-02-06 03:39:32,018 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 03:39:32,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:32,018 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 201 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:32,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 503 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 03:39:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 217. [2025-02-06 03:39:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 175 states have internal predecessors, (206), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 262 transitions. [2025-02-06 03:39:32,043 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 262 transitions. Word has length 135 [2025-02-06 03:39:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:32,044 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 262 transitions. [2025-02-06 03:39:32,044 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:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 262 transitions. [2025-02-06 03:39:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:39:32,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:32,045 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:32,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:32,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:32,246 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:32,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1748985125, now seen corresponding path program 1 times [2025-02-06 03:39:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161585781] [2025-02-06 03:39:32,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:32,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:32,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:39:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059878517] [2025-02-06 03:39:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:32,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:32,338 INFO L229 MonitoredProcess]: Starting monitored process 9 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,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:39:32,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:32,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:32,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:39:32,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:32,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:32,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2025-02-06 03:39:32,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:39:32,906 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:39:33,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2025-02-06 03:39:33,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 03:39:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:39:38,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:39,074 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:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161585781] [2025-02-06 03:39:39,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:39:39,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059878517] [2025-02-06 03:39:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059878517] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 03:39:39,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247110758] [2025-02-06 03:39:39,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:39,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:39,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2025-02-06 03:39:39,076 INFO L87 Difference]: Start difference. First operand 217 states and 262 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:43,321 INFO L93 Difference]: Finished difference Result 393 states and 474 transitions. [2025-02-06 03:39:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:43,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-02-06 03:39:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:43,323 INFO L225 Difference]: With dead ends: 393 [2025-02-06 03:39:43,323 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 03:39:43,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=33, Invalid=148, Unknown=1, NotChecked=0, Total=182 [2025-02-06 03:39:43,326 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 125 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:43,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 615 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 03:39:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2025-02-06 03:39:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.1818181818181819) internal successors, (208), 177 states have internal predecessors, (208), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:39:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2025-02-06 03:39:43,357 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 135 [2025-02-06 03:39:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2025-02-06 03:39:43,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2025-02-06 03:39:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 03:39:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:43,359 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:43,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 03:39:43,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:43,560 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2137157946, now seen corresponding path program 1 times [2025-02-06 03:39:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959633915] [2025-02-06 03:39:43,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:43,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:43,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:43,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:43,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:43,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:39:43,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727035671] [2025-02-06 03:39:43,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:43,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:43,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:43,627 INFO L229 MonitoredProcess]: Starting monitored process 10 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:43,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:39:43,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:44,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:44,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:44,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:44,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:39:44,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 03:39:44,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 03:39:44,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:44,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:44,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:39:44,334 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:39:44,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:39:44,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:44,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:44,563 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:44,695 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:39:44,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:39:44 BoogieIcfgContainer [2025-02-06 03:39:44,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:39:44,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:39:44,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:39:44,699 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:39:44,699 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:11" (3/4) ... [2025-02-06 03:39:44,701 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:39:44,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:39:44,702 INFO L158 Benchmark]: Toolchain (without parser) took 34441.93ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 110.8MB in the beginning and 107.6MB in the end (delta: 3.2MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,702 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:44,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.25ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 97.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.47ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:44,702 INFO L158 Benchmark]: Boogie Preprocessor took 84.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 89.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,703 INFO L158 Benchmark]: IcfgBuilder took 648.99ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 45.1MB in the end (delta: 43.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,703 INFO L158 Benchmark]: TraceAbstraction took 33385.62ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 45.1MB in the beginning and 107.7MB in the end (delta: -62.6MB). Peak memory consumption was 242.3MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,703 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 201.3MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 138.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:44,704 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.93ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.25ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 97.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.47ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.01ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 89.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 648.99ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 45.1MB in the end (delta: 43.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33385.62ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 45.1MB in the beginning and 107.7MB in the end (delta: -62.6MB). Peak memory consumption was 242.3MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 201.3MB. Free memory was 107.7MB in the beginning and 107.6MB in the end (delta: 138.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L22] unsigned char var_1_1 = 8; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_2 = 59049; [L25] unsigned short int* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 100; [L26] unsigned short int var_1_3 = 100; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_7 = -25; [L30] signed char var_1_7 = -25; [L31] signed char* var_1_7_Pointer = &(var_1_7); [L32] signed char var_1_8 = 16; [L32] signed char var_1_8 = 16; [L33] signed char* var_1_8_Pointer = &(var_1_8); [L34] signed char var_1_9 = 25; [L34] signed char var_1_9 = 25; [L35] signed char* var_1_9_Pointer = &(var_1_9); [L36] signed char var_1_10 = -10; [L36] signed char var_1_10 = -10; [L37] signed char* var_1_10_Pointer = &(var_1_10); [L38] signed char var_1_11 = 0; [L38] signed char var_1_11 = 0; [L39] signed char* var_1_11_Pointer = &(var_1_11); [L40] float var_1_12 = 25.1; [L40] float var_1_12 = 25.1; [L41] float* var_1_12_Pointer = &(var_1_12); [L42] unsigned long int var_1_13 = 2531521428; [L42] unsigned long int var_1_13 = 2531521428; [L43] unsigned long int* var_1_13_Pointer = &(var_1_13); [L44] signed long int var_1_14 = -128; [L44] signed long int var_1_14 = -128; [L45] signed long int* var_1_14_Pointer = &(var_1_14); [L46] signed long int var_1_15 = 256; [L46] signed long int var_1_15 = 256; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_16 = -16; [L48] signed short int var_1_16 = -16; [L49] signed short int* var_1_16_Pointer = &(var_1_16); VAL [isInitial=0, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L77] var_1_2 = __VERIFIER_nondet_ushort() [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L80] var_1_3 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L81] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_10 = __VERIFIER_nondet_char() [L93] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_10) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F [L96] EXPR \read(var_1_12) [L96] EXPR var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] EXPR (var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] var_1_13 = __VERIFIER_nondet_ulong() [L98] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR \read(*var_1_8_Pointer) [L53] (*(var_1_14_Pointer)) = (*(var_1_8_Pointer)) [L54] EXPR \read(*var_1_14_Pointer) [L54] (*(var_1_16_Pointer)) = (*(var_1_14_Pointer)) [L55] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L55] EXPR \read(*var_1_14_Pointer) [L55] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] signed long int stepLocal_0 = ((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))); [L56] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_2_Pointer)) <= stepLocal_0) [L59] EXPR \read(*var_1_10_Pointer) [L59] (*(var_1_7_Pointer)) = (*(var_1_10_Pointer)) [L61] EXPR \read(*var_1_16_Pointer) [L61] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_15_Pointer) [L62] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND FALSE !((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L67] EXPR \read(*var_1_1_Pointer) [L67] unsigned char stepLocal_1 = (*(var_1_1_Pointer)); [L68] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L68] COND FALSE !(2.75f > (*(var_1_12_Pointer))) [L71] EXPR \read(*var_1_13_Pointer) [L71] EXPR \read(*var_1_14_Pointer) [L71] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) [L71] EXPR \read(*var_1_8_Pointer) [L71] EXPR (((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, stepLocal_1=3, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L71] COND TRUE ((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > stepLocal_1 [L72] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5)) [L72] EXPR \read(*var_1_8_Pointer) [L72] EXPR (((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))) [L72] EXPR \read(*var_1_10_Pointer) [L72] EXPR (((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L72] (*(var_1_11_Pointer)) = (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_3_Pointer) [L104] EXPR \read(*var_1_15_Pointer) [L104] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L104] EXPR \read(*var_1_1_Pointer) [L104] EXPR \read(*var_1_6_Pointer) [L104] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) [L104] EXPR \read(*var_1_2_Pointer) [L104] EXPR \read(*var_1_14_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) [L104] EXPR \read(*var_1_14_Pointer) [L104] EXPR (((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))) [L104] EXPR \read(*var_1_7_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR ((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) [L104] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1) [L104] EXPR \read(*var_1_11_Pointer) [L104] EXPR \read(*var_1_10_Pointer) [L104] EXPR \read(*var_1_8_Pointer) [L104] EXPR (2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1)) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104-L105] return (((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) ^ ((*(var_1_15_Pointer)) * (*(var_1_16_Pointer)))) <= -64) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) && (((*(var_1_2_Pointer)) <= (((((*(var_1_14_Pointer))) < 0 ) ? -((*(var_1_14_Pointer))) : ((*(var_1_14_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((signed char) (((*(var_1_8_Pointer)) - (1 + (*(var_1_9_Pointer)))) + (*(var_1_10_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && ((2.75f > (*(var_1_12_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) ((*(var_1_10_Pointer)) + (*(var_1_8_Pointer))))) : ((((*(var_1_13_Pointer)) - (((((*(var_1_14_Pointer))) > ((*(var_1_8_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_8_Pointer)))))) > (*(var_1_1_Pointer))) ? ((*(var_1_11_Pointer)) == ((signed char) (((((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) < ((*(var_1_10_Pointer)))) ? ((((((*(var_1_8_Pointer))) < ((1 + 5))) ? ((*(var_1_8_Pointer))) : ((1 + 5))))) : ((*(var_1_10_Pointer))))))) : 1))) && ((*(var_1_14_Pointer)) == ((signed long int) (*(var_1_8_Pointer))))) && ((*(var_1_15_Pointer)) == ((signed long int) (*(var_1_16_Pointer))))) && ((*(var_1_16_Pointer)) == ((signed short int) (*(var_1_14_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_14={15:0}, var_1_14_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_16={17:0}, var_1_16_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.2s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4052 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4052 mSDsluCounter, 12883 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9920 mSDsCounter, 718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3987 IncrementalHoareTripleChecker+Invalid, 4705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 718 mSolverCounterUnsat, 2963 mSDtfsCounter, 3987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2072 GetRequests, 1795 SyntacticMatches, 2 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=12, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 408 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 4012 NumberOfCodeBlocks, 4012 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4095 ConstructedInterpolants, 99 QuantifiedInterpolants, 20413 SizeOfPredicates, 73 NumberOfNonLiveVariables, 4962 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 32 InterpolantComputations, 18 PerfectInterpolantSequences, 11787/13440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 03:39:44,756 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-37.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 b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:46,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:46,826 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:46,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:46,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:46,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:46,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:46,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:46,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:46,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:46,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:46,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:46,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:46,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:46,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:46,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:46,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:46,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:46,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:46,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:46,867 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 -> b82a2feeff1bf45727428077ccadb7452462e1099276a8b897477a025c2c05e5 [2025-02-06 03:39:47,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:47,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:47,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:47,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:47,160 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:47,160 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-37.i [2025-02-06 03:39:48,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094d4c3c5/37197ecf5b8c41b3a123b1105fd10a58/FLAG1f4bfaa04 [2025-02-06 03:39:48,592 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:48,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-37.i [2025-02-06 03:39:48,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094d4c3c5/37197ecf5b8c41b3a123b1105fd10a58/FLAG1f4bfaa04 [2025-02-06 03:39:48,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094d4c3c5/37197ecf5b8c41b3a123b1105fd10a58 [2025-02-06 03:39:48,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:48,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:48,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:48,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:48,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:48,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:48" (1/1) ... [2025-02-06 03:39:48,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d790076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:48, skipping insertion in model container [2025-02-06 03:39:48,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:48" (1/1) ... [2025-02-06 03:39:48,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:48,748 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-37.i[916,929] [2025-02-06 03:39:48,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:48,822 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:48,831 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-37.i[916,929] [2025-02-06 03:39:48,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:48,890 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:48,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:48 WrapperNode [2025-02-06 03:39:48,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:48,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:48,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:48,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:48,897 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:48" (1/1) ... [2025-02-06 03:39:48,910 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:48" (1/1) ... [2025-02-06 03:39:48,945 INFO L138 Inliner]: procedures = 36, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2025-02-06 03:39:48,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:48,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:48,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:48,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:48,953 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:48" (1/1) ... [2025-02-06 03:39:48,954 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:48" (1/1) ... [2025-02-06 03:39:48,961 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:48" (1/1) ... [2025-02-06 03:39:48,993 INFO L175 MemorySlicer]: Split 124 memory accesses to 15 slices as follows [2, 7, 8, 6, 8, 5, 22, 6, 14, 5, 8, 6, 15, 5, 7]. 18 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1]. [2025-02-06 03:39:48,997 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:48" (1/1) ... [2025-02-06 03:39:48,998 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:48" (1/1) ... [2025-02-06 03:39:49,026 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:48" (1/1) ... [2025-02-06 03:39:49,027 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:48" (1/1) ... [2025-02-06 03:39:49,035 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:48" (1/1) ... [2025-02-06 03:39:49,037 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:48" (1/1) ... [2025-02-06 03:39:49,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:49,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:49,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:49,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:49,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:48" (1/1) ... [2025-02-06 03:39:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:49,078 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:49,083 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:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:39:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:39:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:39:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:39:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:39:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:39:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:39:49,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:39:49,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-02-06 03:39:49,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:49,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:39:49,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:39:49,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:39:49,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-02-06 03:39:49,299 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:49,301 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:49,750 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite78#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem83#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem92#1;havoc property_#t~ite114#1;havoc property_#t~mem95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem103#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem107#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1; [2025-02-06 03:39:49,780 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:49,780 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:49,790 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:49,790 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:49,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:49 BoogieIcfgContainer [2025-02-06 03:39:49,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:49,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:49,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:49,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:49,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:48" (1/3) ... [2025-02-06 03:39:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500c1219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:49, skipping insertion in model container [2025-02-06 03:39:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:48" (2/3) ... [2025-02-06 03:39:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500c1219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:49, skipping insertion in model container [2025-02-06 03:39:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:49" (3/3) ... [2025-02-06 03:39:49,798 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-37.i [2025-02-06 03:39:49,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:49,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-37.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:49,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:49,854 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;@217070a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:49,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:49,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:49,865 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:49,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1440740167, now seen corresponding path program 1 times [2025-02-06 03:39:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794459925] [2025-02-06 03:39:49,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:49,877 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:39:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:49,888 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:39:49,890 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:39:50,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:50,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:50,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:50,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:50,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:39:50,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:50,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794459925] [2025-02-06 03:39:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794459925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:39:50,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329208476] [2025-02-06 03:39:50,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:50,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:50,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:50,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:50,328 INFO L87 Difference]: Start difference. First operand has 96 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:50,344 INFO L93 Difference]: Finished difference Result 186 states and 286 transitions. [2025-02-06 03:39:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-02-06 03:39:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:50,349 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:39:50,350 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:39:50,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:50,353 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:50,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:39:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-06 03:39:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-02-06 03:39:50,384 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 122 [2025-02-06 03:39:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:50,384 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-02-06 03:39:50,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-02-06 03:39:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:50,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:50,386 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:50,394 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:39:50,591 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:39:50,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash -201986512, now seen corresponding path program 1 times [2025-02-06 03:39:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391385169] [2025-02-06 03:39:50,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:50,593 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:39:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:50,596 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:39:50,599 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:39:50,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:50,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:39:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-06 03:39:50,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:50,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391385169] [2025-02-06 03:39:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391385169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:50,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625495588] [2025-02-06 03:39:50,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:50,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:50,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:50,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:50,924 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:50,970 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2025-02-06 03:39:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-02-06 03:39:50,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:50,972 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:39:50,973 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 03:39:50,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:50,974 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:50,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 03:39:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 03:39:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-02-06 03:39:50,981 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 122 [2025-02-06 03:39:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:50,982 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-02-06 03:39:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:39:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-02-06 03:39:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:50,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:50,984 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:50,991 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:39:51,184 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:39:51,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1498753967, now seen corresponding path program 1 times [2025-02-06 03:39:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718693847] [2025-02-06 03:39:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:51,188 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:39:51,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:51,190 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:39:51,192 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:39:51,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:51,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:39:51,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:51,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 03:39:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 03:39:51,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:52,053 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-06 03:39:52,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-02-06 03:39:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:39:52,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718693847] [2025-02-06 03:39:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718693847] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:39:52,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:39:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-02-06 03:39:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311391705] [2025-02-06 03:39:52,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:39:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:52,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:39:52,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:52,133 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:39:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:52,584 INFO L93 Difference]: Finished difference Result 193 states and 272 transitions. [2025-02-06 03:39:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:39:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 122 [2025-02-06 03:39:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:52,585 INFO L225 Difference]: With dead ends: 193 [2025-02-06 03:39:52,585 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 03:39:52,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:39:52,586 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 175 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 520 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 03:39:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2025-02-06 03:39:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-02-06 03:39:52,595 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 122 [2025-02-06 03:39:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:52,596 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-02-06 03:39:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-06 03:39:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-02-06 03:39:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:52,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:52,597 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:52,612 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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:52,797 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:39:52,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1551448848, now seen corresponding path program 1 times [2025-02-06 03:39:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012136087] [2025-02-06 03:39:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:52,801 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:39:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:52,803 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:39:52,813 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:39:52,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:53,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:53,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:53,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:53,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:39:53,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:53,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:39:53,812 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:39:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:39:53,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:39:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:39:53,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:54,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:54,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:39:54,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012136087] [2025-02-06 03:39:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012136087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [268370807] [2025-02-06 03:39:54,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:54,426 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:54,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:54,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:39:54,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 03:39:54,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:54,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:54,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:54,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:54,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:39:54,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:54,810 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,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [268370807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-02-06 03:39:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167657583] [2025-02-06 03:39:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:54,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:54,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:39:54,812 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:54,842 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2025-02-06 03:39:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:39:54,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:39:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:54,843 INFO L225 Difference]: With dead ends: 200 [2025-02-06 03:39:54,844 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:39:54,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:39:54,845 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:54,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 492 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:39:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-02-06 03:39:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2025-02-06 03:39:54,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 122 [2025-02-06 03:39:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:54,854 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2025-02-06 03:39:54,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2025-02-06 03:39:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:54,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:54,855 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:54,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-06 03:39:55,066 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:39:55,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:39:55,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:55,261 INFO L85 PathProgramCache]: Analyzing trace with hash 936063985, now seen corresponding path program 1 times [2025-02-06 03:39:55,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:55,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632409052] [2025-02-06 03:39:55,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:55,261 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:39:55,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:55,265 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:39:55,265 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:39:55,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:55,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:39:55,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:56,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:39:56,135 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:39:56,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:39:56,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:39:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:39:56,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:56,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:56,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:39:56,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632409052] [2025-02-06 03:39:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632409052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1220818760] [2025-02-06 03:39:56,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:56,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:56,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:39:56,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 03:39:56,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:56,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:56,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:56,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:56,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:39:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:57,081 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:57,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1220818760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:57,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:57,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-02-06 03:39:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755295537] [2025-02-06 03:39:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:39:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:57,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:39:57,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:39:57,083 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:57,123 INFO L93 Difference]: Finished difference Result 206 states and 283 transitions. [2025-02-06 03:39:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:57,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:39:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:57,124 INFO L225 Difference]: With dead ends: 206 [2025-02-06 03:39:57,124 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 03:39:57,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:39:57,125 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:57,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 605 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 03:39:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 03:39:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2025-02-06 03:39:57,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 122 [2025-02-06 03:39:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:57,132 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2025-02-06 03:39:57,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2025-02-06 03:39:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:57,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:57,133 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:57,141 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 (7)] Ended with exit code 0 [2025-02-06 03:39:57,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:39:57,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:57,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:57,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1823567666, now seen corresponding path program 1 times [2025-02-06 03:39:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:57,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773207910] [2025-02-06 03:39:57,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:57,539 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:39:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:57,541 INFO L229 MonitoredProcess]: Starting monitored process 9 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:39:57,543 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 (9)] Waiting until timeout for monitored process [2025-02-06 03:39:57,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:57,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:57,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:57,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:57,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:39:57,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:58,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:39:58,407 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:39:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:39:58,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:39:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:39:58,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:58,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:39:58,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773207910] [2025-02-06 03:39:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773207910] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:58,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551795974] [2025-02-06 03:39:58,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:58,884 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:39:58,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-06 03:39:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:39:59,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:39:59,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:59,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:59,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:39:59,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:59,321 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:59,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [551795974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-02-06 03:39:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554176867] [2025-02-06 03:39:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:59,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:39:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:59,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:39:59,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:39:59,323 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:59,372 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions. [2025-02-06 03:39:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:39:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:39:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:59,373 INFO L225 Difference]: With dead ends: 210 [2025-02-06 03:39:59,373 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 03:39:59,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:39:59,374 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:59,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 719 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 03:39:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-06 03:39:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:39:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2025-02-06 03:39:59,386 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 122 [2025-02-06 03:39:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:59,386 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2025-02-06 03:39:59,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:39:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2025-02-06 03:39:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:39:59,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:59,389 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:59,397 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 (9)] Ended with exit code 0 [2025-02-06 03:39:59,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-02-06 03:39:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:59,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1824491187, now seen corresponding path program 1 times [2025-02-06 03:39:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592884882] [2025-02-06 03:39:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:59,790 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:39:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:59,792 INFO L229 MonitoredProcess]: Starting monitored process 11 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:39:59,793 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 (11)] Waiting until timeout for monitored process [2025-02-06 03:39:59,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:40:00,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:40:00,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:00,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:00,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 03:40:00,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-06 03:40:00,601 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:00,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:40:00,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 13 proven. 255 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-02-06 03:40:00,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:00,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:00,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:40:01,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592884882] [2025-02-06 03:40:01,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592884882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:01,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [376187135] [2025-02-06 03:40:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:01,055 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:01,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:01,057 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:40:01,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-02-06 03:40:01,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:40:01,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:40:01,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:01,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:01,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:40:01,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:01,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:40:02,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:40:02,462 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:02,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 03:40:02,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:40:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:40:02,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:02,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2025-02-06 03:40:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [376187135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:02,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2025-02-06 03:40:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097871580] [2025-02-06 03:40:02,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 03:40:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:02,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 03:40:02,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:40:02,801 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-06 03:40:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:04,765 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2025-02-06 03:40:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:40:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) Word has length 122 [2025-02-06 03:40:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:04,767 INFO L225 Difference]: With dead ends: 225 [2025-02-06 03:40:04,767 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:40:04,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=524, Invalid=2128, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 03:40:04,768 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 512 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:04,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 966 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:40:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:40:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-02-06 03:40:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:40:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2025-02-06 03:40:04,787 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 122 [2025-02-06 03:40:04,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:04,787 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2025-02-06 03:40:04,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.333333333333333) internal successors, (91), 20 states have internal predecessors, (91), 6 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 3 states have call predecessors, (30), 6 states have call successors, (30) [2025-02-06 03:40:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2025-02-06 03:40:04,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:40:04,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:04,790 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:40:04,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-02-06 03:40:04,997 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 (11)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:05,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /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:05,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:05,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2035842100, now seen corresponding path program 1 times [2025-02-06 03:40:05,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:05,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389821239] [2025-02-06 03:40:05,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:05,191 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:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:05,194 INFO L229 MonitoredProcess]: Starting monitored process 13 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:05,195 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 (13)] Waiting until timeout for monitored process [2025-02-06 03:40:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:40:05,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:40:05,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:05,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:05,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:40:05,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:06,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 03:40:06,806 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:06,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:06,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:06,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-06 03:40:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-06 03:40:06,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:14,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:14,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2025-02-06 03:40:15,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389821239] [2025-02-06 03:40:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389821239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375861692] [2025-02-06 03:40:15,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:15,535 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:40:15,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-02-06 03:40:15,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:40:16,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:40:16,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:16,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:16,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 03:40:16,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:17,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-06 03:40:17,184 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:17,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-02-06 03:40:17,395 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:17,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1375861692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2025-02-06 03:40:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908692484] [2025-02-06 03:40:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:40:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:17,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:40:17,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 03:40:17,398 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:40:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:17,774 INFO L93 Difference]: Finished difference Result 243 states and 315 transitions. [2025-02-06 03:40:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:40:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:17,776 INFO L225 Difference]: With dead ends: 243 [2025-02-06 03:40:17,776 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 03:40:17,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 03:40:17,777 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 80 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:17,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 439 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 03:40:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-02-06 03:40:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 105 states have internal predecessors, (128), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 03:40:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2025-02-06 03:40:17,800 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 122 [2025-02-06 03:40:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:17,801 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2025-02-06 03:40:17,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:40:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2025-02-06 03:40:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:40:17,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:17,802 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:40:17,810 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 (13)] Ended with exit code 0 [2025-02-06 03:40:18,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-02-06 03:40:18,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:18,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:18,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522446, now seen corresponding path program 1 times [2025-02-06 03:40:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31928805] [2025-02-06 03:40:18,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:18,207 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:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:18,209 INFO L229 MonitoredProcess]: Starting monitored process 15 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:18,211 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 (15)] Waiting until timeout for monitored process [2025-02-06 03:40:18,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:40:18,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:40:18,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:18,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:18,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:40:18,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:19,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 03:40:19,876 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:19,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:19,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-06 03:40:19,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-06 03:40:20,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:27,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:27,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2025-02-06 03:40:29,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31928805] [2025-02-06 03:40:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31928805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [943920634] [2025-02-06 03:40:29,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:29,412 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:29,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:29,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:40:29,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-02-06 03:40:29,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:40:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:40:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:29,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:40:29,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:30,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 03:40:30,399 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:30,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:40:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [943920634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:40:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2025-02-06 03:40:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484468475] [2025-02-06 03:40:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:30,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:30,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:30,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:40:30,400 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:40:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:30,603 INFO L93 Difference]: Finished difference Result 287 states and 367 transitions. [2025-02-06 03:40:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:30,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2025-02-06 03:40:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:30,605 INFO L225 Difference]: With dead ends: 287 [2025-02-06 03:40:30,605 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:40:30,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=249, Invalid=1233, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 03:40:30,606 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 115 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:30,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 557 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:40:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2025-02-06 03:40:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 110 states have internal predecessors, (132), 21 states have call successors, (21), 7 states have call predecessors, (21), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 03:40:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2025-02-06 03:40:30,624 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 125 [2025-02-06 03:40:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:30,624 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2025-02-06 03:40:30,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:40:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2025-02-06 03:40:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:40:30,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:30,625 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:40:30,633 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 (15)] Ended with exit code 0 [2025-02-06 03:40:30,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-02-06 03:40:31,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:31,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:31,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1750893041, now seen corresponding path program 1 times [2025-02-06 03:40:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720324185] [2025-02-06 03:40:31,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:31,030 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:31,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:31,032 INFO L229 MonitoredProcess]: Starting monitored process 17 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:31,033 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 (17)] Waiting until timeout for monitored process [2025-02-06 03:40:31,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:40:31,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:40:31,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:31,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:31,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:40:31,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:32,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-02-06 03:40:32,710 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:32,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:32,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-02-06 03:40:32,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 03:40:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 305 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-06 03:40:32,894 INFO L312 TraceCheckSpWp]: Computing backward predicates...