./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:37:26,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:37:26,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:37:26,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:37:26,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:37:26,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:37:26,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:37:26,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:37:26,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:37:26,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:37:26,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:37:26,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:37:26,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:37:26,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:37:26,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:37:26,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:26,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:26,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:26,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:37:26,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:37:26,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:37:26,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:37:26,541 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2025-01-09 15:37:26,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:37:26,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:37:26,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:37:26,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:37:26,770 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:37:26,771 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-ap_file-67.i [2025-01-09 15:37:28,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b9c872d7/f97704e9637f42aab33dad97ba26b05e/FLAGbca53343a [2025-01-09 15:37:28,262 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:37:28,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2025-01-09 15:37:28,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b9c872d7/f97704e9637f42aab33dad97ba26b05e/FLAGbca53343a [2025-01-09 15:37:28,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b9c872d7/f97704e9637f42aab33dad97ba26b05e [2025-01-09 15:37:28,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:37:28,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:37:28,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:28,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:37:28,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:37:28,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344d3e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28, skipping insertion in model container [2025-01-09 15:37:28,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:37:28,407 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-ap_file-67.i[917,930] [2025-01-09 15:37:28,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:28,470 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:37:28,479 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-ap_file-67.i[917,930] [2025-01-09 15:37:28,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:28,512 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:37:28,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28 WrapperNode [2025-01-09 15:37:28,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:28,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:28,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:37:28,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:37:28,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,552 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-01-09 15:37:28,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:28,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:37:28,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:37:28,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:37:28,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,576 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-01-09 15:37:28,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:37:28,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:37:28,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:37:28,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:37:28,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (1/1) ... [2025-01-09 15:37:28,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:28,649 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-01-09 15:37:28,652 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-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:37:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:37:28,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:37:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:37:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:37:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:37:28,765 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:37:28,766 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:37:29,059 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-01-09 15:37:29,059 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:37:29,068 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:37:29,068 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:37:29,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:29 BoogieIcfgContainer [2025-01-09 15:37:29,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:37:29,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:37:29,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:37:29,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:37:29,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:37:28" (1/3) ... [2025-01-09 15:37:29,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbc654e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:29, skipping insertion in model container [2025-01-09 15:37:29,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:28" (2/3) ... [2025-01-09 15:37:29,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbc654e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:29, skipping insertion in model container [2025-01-09 15:37:29,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:29" (3/3) ... [2025-01-09 15:37:29,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2025-01-09 15:37:29,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:37:29,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-67.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:37:29,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:37:29,140 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;@2365d8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:37:29,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:37:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:29,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:29,151 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:29,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:29,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:29,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1000440832, now seen corresponding path program 1 times [2025-01-09 15:37:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960937453] [2025-01-09 15:37:29,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:29,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:29,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:29,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:29,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:37:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:29,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960937453] [2025-01-09 15:37:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960937453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872074186] [2025-01-09 15:37:29,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:29,432 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-01-09 15:37:29,433 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-01-09 15:37:29,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:29,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:29,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:29,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:29,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:37:29,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:37:29,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872074186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:37:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:37:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079691872] [2025-01-09 15:37:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:29,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:37:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:29,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:37:29,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:37:29,661 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:29,680 INFO L93 Difference]: Finished difference Result 178 states and 269 transitions. [2025-01-09 15:37:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:37:29,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 15:37:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:29,689 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:37:29,689 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:37:29,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-01-09 15:37:29,692 INFO L435 NwaCegarLoop]: 126 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, 126 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-01-09 15:37:29,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:37:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:37:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-01-09 15:37:29,715 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2025-01-09 15:37:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:29,716 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-01-09 15:37:29,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-01-09 15:37:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:29,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:29,718 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:29,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:37:29,919 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-01-09 15:37:29,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:29,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -221387664, now seen corresponding path program 1 times [2025-01-09 15:37:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963272918] [2025-01-09 15:37:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:29,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:30,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:30,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963272918] [2025-01-09 15:37:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963272918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:37:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722509654] [2025-01-09 15:37:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:37:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:37:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:37:30,166 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,197 INFO L93 Difference]: Finished difference Result 225 states and 321 transitions. [2025-01-09 15:37:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:37:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:37:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,199 INFO L225 Difference]: With dead ends: 225 [2025-01-09 15:37:30,199 INFO L226 Difference]: Without dead ends: 139 [2025-01-09 15:37:30,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:37:30,200 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-01-09 15:37:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2025-01-09 15:37:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-01-09 15:37:30,215 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 104 [2025-01-09 15:37:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-01-09 15:37:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-01-09 15:37:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:30,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,217 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:30,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:37:30,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1058476014, now seen corresponding path program 1 times [2025-01-09 15:37:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853799851] [2025-01-09 15:37:30,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:30,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:30,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853799851] [2025-01-09 15:37:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853799851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:37:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398665246] [2025-01-09 15:37:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:37:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:37:30,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:37:30,441 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,469 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2025-01-09 15:37:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:37:30,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:37:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,470 INFO L225 Difference]: With dead ends: 210 [2025-01-09 15:37:30,471 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:37:30,471 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-01-09 15:37:30,471 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:37:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-01-09 15:37:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2025-01-09 15:37:30,477 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 104 [2025-01-09 15:37:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,477 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2025-01-09 15:37:30,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2025-01-09 15:37:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:30,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,478 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:37:30,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1738534384, now seen corresponding path program 1 times [2025-01-09 15:37:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931142812] [2025-01-09 15:37:30,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:30,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:30,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931142812] [2025-01-09 15:37:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931142812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:37:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128364658] [2025-01-09 15:37:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:37:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:37:30,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:37:30,567 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,591 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2025-01-09 15:37:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:37:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:37:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,592 INFO L225 Difference]: With dead ends: 214 [2025-01-09 15:37:30,592 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:37:30,593 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-01-09 15:37:30,593 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:37:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 15:37:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2025-01-09 15:37:30,599 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 104 [2025-01-09 15:37:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2025-01-09 15:37:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2025-01-09 15:37:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:30,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,600 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:30,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:37:30,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash -781425550, now seen corresponding path program 1 times [2025-01-09 15:37:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666678526] [2025-01-09 15:37:30,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:30,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:30,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:30,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:30,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666678526] [2025-01-09 15:37:30,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666678526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:30,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:30,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:37:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757710253] [2025-01-09 15:37:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:37:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:30,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:37:30,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:37:30,694 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:30,709 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2025-01-09 15:37:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:37:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:37:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:30,710 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:37:30,711 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:37:30,711 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-01-09 15:37:30,711 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:30,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:37:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 15:37:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2025-01-09 15:37:30,717 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 104 [2025-01-09 15:37:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:30,717 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2025-01-09 15:37:30,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2025-01-09 15:37:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:30,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:30,718 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:30,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:37:30,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -779578508, now seen corresponding path program 1 times [2025-01-09 15:37:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310608441] [2025-01-09 15:37:30,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:30,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:30,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:30,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:30,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-01-09 15:37:34,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310608441] [2025-01-09 15:37:34,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310608441] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003107130] [2025-01-09 15:37:34,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:34,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:34,508 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-01-09 15:37:34,509 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-01-09 15:37:34,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:34,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:34,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 15:37:34,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:35,537 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-01-09 15:37:35,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 59 [2025-01-09 15:37:35,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2025-01-09 15:37:35,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:35,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2025-01-09 15:37:36,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:36,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:36,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:37:36,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:37:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 110 [2025-01-09 15:37:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-01-09 15:37:36,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:37:36,797 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-01-09 15:37:36,797 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 886 treesize of output 806 [2025-01-09 15:37:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003107130] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:37:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 10] total 31 [2025-01-09 15:37:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455659967] [2025-01-09 15:37:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:37,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:37,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:37:37,764 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:38,365 INFO L93 Difference]: Finished difference Result 358 states and 498 transitions. [2025-01-09 15:37:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:37:38,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 15:37:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:38,367 INFO L225 Difference]: With dead ends: 358 [2025-01-09 15:37:38,367 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 15:37:38,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 15:37:38,369 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 421 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:38,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 774 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 15:37:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 187. [2025-01-09 15:37:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.355421686746988) internal successors, (225), 167 states have internal predecessors, (225), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:37:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 261 transitions. [2025-01-09 15:37:38,381 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 261 transitions. Word has length 104 [2025-01-09 15:37:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:38,381 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 261 transitions. [2025-01-09 15:37:38,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 261 transitions. [2025-01-09 15:37:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:37:38,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:38,383 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:38,390 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-01-09 15:37:38,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:38,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:38,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1709950454, now seen corresponding path program 1 times [2025-01-09 15:37:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:38,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397614210] [2025-01-09 15:37:38,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:38,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:37:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:37:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397614210] [2025-01-09 15:37:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397614210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:37:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194293957] [2025-01-09 15:37:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:38,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:37:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:38,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:37:38,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:37:38,654 INFO L87 Difference]: Start difference. First operand 187 states and 261 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:38,679 INFO L93 Difference]: Finished difference Result 371 states and 517 transitions. [2025-01-09 15:37:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:37:38,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 15:37:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:38,682 INFO L225 Difference]: With dead ends: 371 [2025-01-09 15:37:38,683 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 15:37:38,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:37:38,685 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 62 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 15:37:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-01-09 15:37:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 165 states have internal predecessors, (221), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:37:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2025-01-09 15:37:38,709 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 104 [2025-01-09 15:37:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2025-01-09 15:37:38,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2025-01-09 15:37:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:37:38,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:38,714 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:38,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:37:38,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:38,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:38,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1628593425, now seen corresponding path program 1 times [2025-01-09 15:37:38,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245662775] [2025-01-09 15:37:38,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:38,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:37:38,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:37:38,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:38,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245662775] [2025-01-09 15:37:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245662775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895752683] [2025-01-09 15:37:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:39,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:39,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:39,459 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:39,750 INFO L93 Difference]: Finished difference Result 392 states and 543 transitions. [2025-01-09 15:37:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 15:37:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:39,752 INFO L225 Difference]: With dead ends: 392 [2025-01-09 15:37:39,752 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 15:37:39,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:39,753 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 247 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:39,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 477 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 15:37:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 170. [2025-01-09 15:37:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3288590604026846) internal successors, (198), 150 states have internal predecessors, (198), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:37:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2025-01-09 15:37:39,770 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 105 [2025-01-09 15:37:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:39,774 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2025-01-09 15:37:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2025-01-09 15:37:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:37:39,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:39,775 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:37:39,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1074664573, now seen corresponding path program 1 times [2025-01-09 15:37:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461784873] [2025-01-09 15:37:39,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:39,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:37:39,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:37:39,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:39,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461784873] [2025-01-09 15:37:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461784873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:40,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444791857] [2025-01-09 15:37:40,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:40,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:40,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:40,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:40,546 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:41,085 INFO L93 Difference]: Finished difference Result 492 states and 677 transitions. [2025-01-09 15:37:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:37:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 15:37:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:41,091 INFO L225 Difference]: With dead ends: 492 [2025-01-09 15:37:41,091 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 15:37:41,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:37:41,092 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 315 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:41,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 897 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 15:37:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2025-01-09 15:37:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 283 states have (on average 1.3215547703180213) internal successors, (374), 286 states have internal predecessors, (374), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:37:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 442 transitions. [2025-01-09 15:37:41,131 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 442 transitions. Word has length 108 [2025-01-09 15:37:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 442 transitions. [2025-01-09 15:37:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 442 transitions. [2025-01-09 15:37:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:37:41,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:41,133 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:41,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:37:41,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2055721256, now seen corresponding path program 1 times [2025-01-09 15:37:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704093658] [2025-01-09 15:37:41,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:41,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:37:41,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:37:41,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:41,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704093658] [2025-01-09 15:37:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704093658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:41,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:41,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933848140] [2025-01-09 15:37:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:41,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:41,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:41,286 INFO L87 Difference]: Start difference. First operand 322 states and 442 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:41,497 INFO L93 Difference]: Finished difference Result 792 states and 1089 transitions. [2025-01-09 15:37:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:37:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:41,502 INFO L225 Difference]: With dead ends: 792 [2025-01-09 15:37:41,502 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 15:37:41,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:41,504 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 93 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:41,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 930 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 15:37:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 353. [2025-01-09 15:37:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.3375796178343948) internal successors, (420), 317 states have internal predecessors, (420), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:37:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2025-01-09 15:37:41,529 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 110 [2025-01-09 15:37:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:41,530 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2025-01-09 15:37:41,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2025-01-09 15:37:41,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:37:41,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:41,532 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:37:41,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1506674600, now seen corresponding path program 1 times [2025-01-09 15:37:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469459631] [2025-01-09 15:37:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:41,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:37:41,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:37:41,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:41,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:41,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469459631] [2025-01-09 15:37:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469459631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:37:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34744914] [2025-01-09 15:37:41,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:37:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:41,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:37:41,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:37:41,656 INFO L87 Difference]: Start difference. First operand 353 states and 488 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:41,870 INFO L93 Difference]: Finished difference Result 836 states and 1153 transitions. [2025-01-09 15:37:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:37:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 15:37:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:41,874 INFO L225 Difference]: With dead ends: 836 [2025-01-09 15:37:41,874 INFO L226 Difference]: Without dead ends: 486 [2025-01-09 15:37:41,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:37:41,875 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:41,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 877 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-01-09 15:37:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 379. [2025-01-09 15:37:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 340 states have (on average 1.3441176470588236) internal successors, (457), 343 states have internal predecessors, (457), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:37:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 525 transitions. [2025-01-09 15:37:41,901 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 525 transitions. Word has length 110 [2025-01-09 15:37:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 525 transitions. [2025-01-09 15:37:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 525 transitions. [2025-01-09 15:37:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:37:41,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:41,903 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:37:41,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 993437572, now seen corresponding path program 1 times [2025-01-09 15:37:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:41,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070562311] [2025-01-09 15:37:41,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:41,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:37:41,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:37:41,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:41,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:41,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070562311] [2025-01-09 15:37:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070562311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096334560] [2025-01-09 15:37:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:41,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:41,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:41,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:41,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:41,995 INFO L87 Difference]: Start difference. First operand 379 states and 525 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:42,118 INFO L93 Difference]: Finished difference Result 860 states and 1187 transitions. [2025-01-09 15:37:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:42,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:37:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:42,121 INFO L225 Difference]: With dead ends: 860 [2025-01-09 15:37:42,121 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 15:37:42,122 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-01-09 15:37:42,122 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 85 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:42,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 543 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 15:37:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 378. [2025-01-09 15:37:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 339 states have (on average 1.3392330383480826) internal successors, (454), 342 states have internal predecessors, (454), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:37:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 522 transitions. [2025-01-09 15:37:42,157 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 522 transitions. Word has length 111 [2025-01-09 15:37:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 522 transitions. [2025-01-09 15:37:42,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 522 transitions. [2025-01-09 15:37:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:37:42,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:42,160 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:42,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:37:42,160 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1257688827, now seen corresponding path program 1 times [2025-01-09 15:37:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226670511] [2025-01-09 15:37:42,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:42,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:37:42,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:37:42,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:42,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:42,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:42,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226670511] [2025-01-09 15:37:42,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226670511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:42,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:42,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043656828] [2025-01-09 15:37:42,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:42,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:42,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:42,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:42,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:42,247 INFO L87 Difference]: Start difference. First operand 378 states and 522 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:42,378 INFO L93 Difference]: Finished difference Result 867 states and 1188 transitions. [2025-01-09 15:37:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 15:37:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:42,381 INFO L225 Difference]: With dead ends: 867 [2025-01-09 15:37:42,381 INFO L226 Difference]: Without dead ends: 492 [2025-01-09 15:37:42,382 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-01-09 15:37:42,382 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 88 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:42,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 569 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-09 15:37:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 265. [2025-01-09 15:37:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 238 states have (on average 1.3403361344537814) internal successors, (319), 239 states have internal predecessors, (319), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:37:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 363 transitions. [2025-01-09 15:37:42,406 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 363 transitions. Word has length 111 [2025-01-09 15:37:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:42,406 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 363 transitions. [2025-01-09 15:37:42,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2025-01-09 15:37:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:42,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:42,410 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:42,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:37:42,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:42,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash -964618227, now seen corresponding path program 1 times [2025-01-09 15:37:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:42,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-01-09 15:37:42,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:42,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:42,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:42,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:43,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023350698] [2025-01-09 15:37:43,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023350698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:43,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:43,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:37:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495899852] [2025-01-09 15:37:43,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:43,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:37:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:43,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:37:43,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:37:43,195 INFO L87 Difference]: Start difference. First operand 265 states and 363 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:44,042 INFO L93 Difference]: Finished difference Result 654 states and 893 transitions. [2025-01-09 15:37:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:37:44,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 15:37:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:44,045 INFO L225 Difference]: With dead ends: 654 [2025-01-09 15:37:44,045 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 15:37:44,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:37:44,046 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 485 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:44,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1488 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:37:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 15:37:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 322. [2025-01-09 15:37:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.3491525423728814) internal successors, (398), 296 states have internal predecessors, (398), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:37:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 442 transitions. [2025-01-09 15:37:44,089 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 442 transitions. Word has length 112 [2025-01-09 15:37:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 442 transitions. [2025-01-09 15:37:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 442 transitions. [2025-01-09 15:37:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:44,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:44,091 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:44,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:37:44,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:44,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2050485391, now seen corresponding path program 1 times [2025-01-09 15:37:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352163759] [2025-01-09 15:37:44,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:44,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:44,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:44,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:44,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:44,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352163759] [2025-01-09 15:37:44,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352163759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:44,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:44,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579478988] [2025-01-09 15:37:44,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:44,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:44,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:44,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:44,656 INFO L87 Difference]: Start difference. First operand 322 states and 442 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:45,185 INFO L93 Difference]: Finished difference Result 745 states and 1016 transitions. [2025-01-09 15:37:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:45,185 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 15:37:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:45,187 INFO L225 Difference]: With dead ends: 745 [2025-01-09 15:37:45,187 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 15:37:45,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:37:45,188 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 357 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:45,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 982 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 15:37:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 322. [2025-01-09 15:37:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 295 states have (on average 1.3457627118644069) internal successors, (397), 296 states have internal predecessors, (397), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:37:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 441 transitions. [2025-01-09 15:37:45,213 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 441 transitions. Word has length 112 [2025-01-09 15:37:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:45,213 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 441 transitions. [2025-01-09 15:37:45,213 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 441 transitions. [2025-01-09 15:37:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:45,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:45,215 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:45,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:37:45,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:45,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:45,216 INFO L85 PathProgramCache]: Analyzing trace with hash 958609807, now seen corresponding path program 1 times [2025-01-09 15:37:45,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002892168] [2025-01-09 15:37:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:45,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:45,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:45,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:45,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002892168] [2025-01-09 15:37:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002892168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251123103] [2025-01-09 15:37:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:45,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:45,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:45,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:45,712 INFO L87 Difference]: Start difference. First operand 322 states and 441 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:46,169 INFO L93 Difference]: Finished difference Result 648 states and 884 transitions. [2025-01-09 15:37:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:46,170 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 15:37:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:46,171 INFO L225 Difference]: With dead ends: 648 [2025-01-09 15:37:46,171 INFO L226 Difference]: Without dead ends: 329 [2025-01-09 15:37:46,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:37:46,173 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 273 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:46,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 865 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:46,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-09 15:37:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 262. [2025-01-09 15:37:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 246 states have internal predecessors, (334), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2025-01-09 15:37:46,188 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 112 [2025-01-09 15:37:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2025-01-09 15:37:46,188 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2025-01-09 15:37:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:46,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:46,190 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:46,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:37:46,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash -321253871, now seen corresponding path program 1 times [2025-01-09 15:37:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054687575] [2025-01-09 15:37:46,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:46,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:46,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:46,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054687575] [2025-01-09 15:37:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054687575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:37:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872355141] [2025-01-09 15:37:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:37:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:46,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:37:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:37:46,529 INFO L87 Difference]: Start difference. First operand 262 states and 358 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:46,907 INFO L93 Difference]: Finished difference Result 591 states and 804 transitions. [2025-01-09 15:37:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:37:46,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 15:37:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:46,909 INFO L225 Difference]: With dead ends: 591 [2025-01-09 15:37:46,909 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 15:37:46,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:37:46,910 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 257 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:46,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1177 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 15:37:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 262. [2025-01-09 15:37:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 246 states have internal predecessors, (334), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 358 transitions. [2025-01-09 15:37:46,942 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 358 transitions. Word has length 112 [2025-01-09 15:37:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:46,942 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 358 transitions. [2025-01-09 15:37:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 358 transitions. [2025-01-09 15:37:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:46,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:46,943 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:46,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:37:46,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:46,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1197383852, now seen corresponding path program 1 times [2025-01-09 15:37:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:46,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411230649] [2025-01-09 15:37:46,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:46,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:46,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:46,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:46,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411230649] [2025-01-09 15:37:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411230649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:47,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:47,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:37:47,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384269773] [2025-01-09 15:37:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:47,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:37:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:47,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:37:47,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:37:47,075 INFO L87 Difference]: Start difference. First operand 262 states and 358 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:47,117 INFO L93 Difference]: Finished difference Result 617 states and 821 transitions. [2025-01-09 15:37:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:37:47,118 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-01-09 15:37:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:47,119 INFO L225 Difference]: With dead ends: 617 [2025-01-09 15:37:47,119 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 15:37:47,120 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-01-09 15:37:47,121 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 44 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 460 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 15:37:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 331. [2025-01-09 15:37:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 315 states have (on average 1.2952380952380953) internal successors, (408), 315 states have internal predecessors, (408), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 432 transitions. [2025-01-09 15:37:47,137 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 432 transitions. Word has length 112 [2025-01-09 15:37:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 432 transitions. [2025-01-09 15:37:47,137 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 432 transitions. [2025-01-09 15:37:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:47,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:47,139 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:37:47,139 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:47,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1523649523, now seen corresponding path program 1 times [2025-01-09 15:37:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395609489] [2025-01-09 15:37:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:47,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:47,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:47,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:47,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395609489] [2025-01-09 15:37:47,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395609489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:47,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:47,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:37:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137896648] [2025-01-09 15:37:47,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:37:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:47,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:37:47,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:47,814 INFO L87 Difference]: Start difference. First operand 331 states and 432 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:48,251 INFO L93 Difference]: Finished difference Result 371 states and 483 transitions. [2025-01-09 15:37:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:37:48,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 15:37:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:48,253 INFO L225 Difference]: With dead ends: 371 [2025-01-09 15:37:48,253 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 15:37:48,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:37:48,254 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 250 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:48,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 729 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 15:37:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 334. [2025-01-09 15:37:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 318 states have (on average 1.2924528301886793) internal successors, (411), 318 states have internal predecessors, (411), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2025-01-09 15:37:48,272 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 112 [2025-01-09 15:37:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:48,272 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2025-01-09 15:37:48,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:37:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2025-01-09 15:37:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 15:37:48,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:48,273 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:48,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:37:48,274 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:48,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1521802481, now seen corresponding path program 1 times [2025-01-09 15:37:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162967210] [2025-01-09 15:37:48,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:48,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:48,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:48,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:48,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:37:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223109629] [2025-01-09 15:37:48,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:48,369 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-01-09 15:37:48,370 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-01-09 15:37:48,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:48,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:48,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:48,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:37:48,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:37:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 15:37:48,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 15:37:48,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:48,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:37:48,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:37:48,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:37:48,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:37:48,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:37:49,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:49,157 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] [2025-01-09 15:37:49,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:37:49,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:37:49 BoogieIcfgContainer [2025-01-09 15:37:49,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:37:49,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:37:49,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:37:49,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:37:49,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:29" (3/4) ... [2025-01-09 15:37:49,276 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:37:49,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:37:49,278 INFO L158 Benchmark]: Toolchain (without parser) took 20988.30ms. Allocated memory was 167.8MB in the beginning and 755.0MB in the end (delta: 587.2MB). Free memory was 132.5MB in the beginning and 659.1MB in the end (delta: -526.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2025-01-09 15:37:49,278 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:49,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.03ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 118.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:37:49,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:49,280 INFO L158 Benchmark]: Boogie Preprocessor took 56.99ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:49,280 INFO L158 Benchmark]: RCFGBuilder took 457.44ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 79.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:37:49,280 INFO L158 Benchmark]: TraceAbstraction took 20200.32ms. Allocated memory was 167.8MB in the beginning and 755.0MB in the end (delta: 587.2MB). Free memory was 78.6MB in the beginning and 659.4MB in the end (delta: -580.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-01-09 15:37:49,280 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 755.0MB. Free memory was 659.4MB in the beginning and 659.1MB in the end (delta: 244.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:49,281 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.18ms. Allocated memory is still 226.5MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.03ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 118.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.99ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.44ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 79.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20200.32ms. Allocated memory was 167.8MB in the beginning and 755.0MB in the end (delta: 587.2MB). Free memory was 78.6MB in the beginning and 659.4MB in the end (delta: -580.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 755.0MB. Free memory was 659.4MB in the beginning and 659.1MB in the end (delta: 244.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[1] = { 25.875 }; [L26-L28] double double_Array_0[1] = { 25.875 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L30-L32] float float_Array_0[2] = { 0.9, 15.125 }; [L33] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L34] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L35-L37] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L39] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L40-L42] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L44] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L45] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer = &(signed_short_int_Array_0[2]); [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L46-L48] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L49] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L50] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); [L51] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer = &(unsigned_short_int_Array_0[2]); [L52] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L53] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L54] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=0, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L116] isInitial = 1 [L117] FCALL initially() [L119] CALL updateLastVariables() [L107] EXPR signed_long_int_Array_0[1] [L107] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L108] EXPR signed_short_int_Array_0[2] [L108] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L109] EXPR unsigned_short_int_Array_0[2] [L109] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L119] RET updateLastVariables() [L120] CALL updateVariables() [L87] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L90] float_Array_0[0] = __VERIFIER_nondet_float() [L91] EXPR float_Array_0[0] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L91] EXPR float_Array_0[0] [L91] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L91] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L92] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L93] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L94] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L95] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L96] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L97] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L97] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L98] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L99] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L100] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L101] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L102] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L103] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L103] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L104] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L120] RET updateVariables() [L121] CALL step() [L58] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L59] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L61] signed long int stepLocal_0 = 1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)); [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L62] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, stepLocal_0=51, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L62] COND FALSE !(((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > stepLocal_0) [L65] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L65] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L67] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L67] (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L68] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L68] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) [L69] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L69] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) [L70] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L70] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L70] signed long int stepLocal_2 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)); [L71] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L71] unsigned short int stepLocal_1 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)); [L72] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L72] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L75] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L75] COND FALSE !((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > stepLocal_2) [L82] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L82] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L82] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L112] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L112] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) [L112] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L112] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) [L112] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L112] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer) [L112] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L112] EXPR ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L112] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L112] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L112] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) [L112] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L112] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L112] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L112-L113] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))))) : 1) && ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer)) >> (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) > (1 * (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (((((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) > (0)) ? ((42286 - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : (0))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) < (last_1_signed_long_int_Array_0_1_)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) : (last_1_signed_long_int_Array_0_1_))))) : (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) > ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) / (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? (((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) > (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) < (100)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) : (100))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (last_1_signed_long_int_Array_0_1_ - (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer)) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))))) && ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={6:4}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={7:4}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={8:2}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var2_Pointer={8:4}, unsigned_short_int_Array_0={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={9:2}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var2_Pointer={9:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3128 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3128 mSDsluCounter, 12529 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9634 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4036 IncrementalHoareTripleChecker+Invalid, 4400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 2895 mSDtfsCounter, 4036 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=11, InterpolantAutomatonStates: 129, 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, 19 MinimizatonAttempts, 1078 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2345 ConstructedInterpolants, 0 QuantifiedInterpolants, 17738 SizeOfPredicates, 12 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 5622/5808 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-01-09 15:37:49,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-ap_file-67.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 a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:37:51,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:37:51,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:37:51,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:37:51,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:37:51,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:37:51,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:37:51,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:37:51,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:37:51,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:37:51,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:37:51,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:37:51,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:37:51,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:37:51,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:37:51,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:51,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:51,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:51,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:37:51,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:37:51,417 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 -> a52320cf15ef16183046f0f792382098821a237814ee842f46de00a84d4e09b2 [2025-01-09 15:37:51,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:37:51,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:37:51,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:37:51,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:37:51,612 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:37:51,613 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-ap_file-67.i [2025-01-09 15:37:52,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/155fd80b5/4ac6d66c3e3d48949744ca7bc041d5b9/FLAGf06b78c20 [2025-01-09 15:37:53,008 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:37:53,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-67.i [2025-01-09 15:37:53,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/155fd80b5/4ac6d66c3e3d48949744ca7bc041d5b9/FLAGf06b78c20 [2025-01-09 15:37:53,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/155fd80b5/4ac6d66c3e3d48949744ca7bc041d5b9 [2025-01-09 15:37:53,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:37:53,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:37:53,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:53,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:37:53,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:37:53,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338492ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53, skipping insertion in model container [2025-01-09 15:37:53,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:37:53,470 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-ap_file-67.i[917,930] [2025-01-09 15:37:53,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:53,527 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:37:53,535 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-ap_file-67.i[917,930] [2025-01-09 15:37:53,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:53,581 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:37:53,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53 WrapperNode [2025-01-09 15:37:53,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:53,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:53,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:37:53,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:37:53,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,629 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 401 [2025-01-09 15:37:53,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:53,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:37:53,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:37:53,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:37:53,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,666 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-01-09 15:37:53,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:37:53,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:37:53,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:37:53,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:37:53,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (1/1) ... [2025-01-09 15:37:53,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:53,726 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-01-09 15:37:53,731 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-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:37:53,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:37:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:37:53,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:37:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:37:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:37:53,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:37:53,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:37:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:37:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:37:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:37:53,889 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:37:53,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:37:54,475 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 15:37:54,476 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:37:54,489 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:37:54,490 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:37:54,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:54 BoogieIcfgContainer [2025-01-09 15:37:54,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:37:54,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:37:54,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:37:54,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:37:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:37:53" (1/3) ... [2025-01-09 15:37:54,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:54, skipping insertion in model container [2025-01-09 15:37:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:53" (2/3) ... [2025-01-09 15:37:54,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdee17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:54, skipping insertion in model container [2025-01-09 15:37:54,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:54" (3/3) ... [2025-01-09 15:37:54,499 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-67.i [2025-01-09 15:37:54,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:37:54,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:37:54,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:37:54,565 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;@a6fd3d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:37:54,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:37:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:37:54,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:54,576 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:54,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash -192738940, now seen corresponding path program 1 times [2025-01-09 15:37:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:37:54,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317123866] [2025-01-09 15:37:54,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:54,588 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-01-09 15:37:54,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:37:54,591 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-01-09 15:37:54,593 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-01-09 15:37:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:37:54,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:37:54,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:54,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:54,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:37:54,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-09 15:37:54,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:54,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:37:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317123866] [2025-01-09 15:37:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317123866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:54,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:37:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616175218] [2025-01-09 15:37:54,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:54,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:37:54,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:37:54,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:37:54,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:37:54,948 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:54,970 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-01-09 15:37:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:37:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:37:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:54,978 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:37:54,979 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:37:54,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:37:54,984 INFO L435 NwaCegarLoop]: 119 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, 119 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-01-09 15:37:54,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:37:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:37:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-01-09 15:37:55,011 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2025-01-09 15:37:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:55,011 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-01-09 15:37:55,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:37:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-01-09 15:37:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:37:55,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:55,014 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:55,024 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-01-09 15:37:55,214 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-01-09 15:37:55,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:55,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 525128468, now seen corresponding path program 1 times [2025-01-09 15:37:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:37:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751868040] [2025-01-09 15:37:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:55,216 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-01-09 15:37:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:37:55,218 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-01-09 15:37:55,220 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-01-09 15:37:55,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:37:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:37:55,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:55,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:55,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:37:55,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:55,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:55,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:37:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751868040] [2025-01-09 15:37:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751868040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:37:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123117998] [2025-01-09 15:37:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:37:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:37:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:37:55,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:55,569 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:55,651 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-01-09 15:37:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:37:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:37:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:55,653 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:37:55,653 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:37:55,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:55,654 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:55,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:37:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-01-09 15:37:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-01-09 15:37:55,661 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2025-01-09 15:37:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:55,661 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-01-09 15:37:55,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-01-09 15:37:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:37:55,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:55,663 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:55,672 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-01-09 15:37:55,864 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-01-09 15:37:55,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1994831466, now seen corresponding path program 1 times [2025-01-09 15:37:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:37:55,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080739323] [2025-01-09 15:37:55,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:55,866 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-01-09 15:37:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:37:55,868 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-01-09 15:37:55,870 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-01-09 15:37:55,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:37:56,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:37:56,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:56,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:56,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:37:56,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:37:56,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:56,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:37:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080739323] [2025-01-09 15:37:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080739323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265679126] [2025-01-09 15:37:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:56,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:37:56,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:56,171 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:56,250 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-01-09 15:37:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:56,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:37:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:56,252 INFO L225 Difference]: With dead ends: 180 [2025-01-09 15:37:56,252 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:37:56,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:56,253 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:56,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:37:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-01-09 15:37:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:37:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-01-09 15:37:56,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2025-01-09 15:37:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:56,259 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-01-09 15:37:56,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:37:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-01-09 15:37:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:37:56,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:56,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:37:56,272 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-01-09 15:37:56,460 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-01-09 15:37:56,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:56,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:56,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1992984424, now seen corresponding path program 1 times [2025-01-09 15:37:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:37:56,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271602491] [2025-01-09 15:37:56,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:56,463 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-01-09 15:37:56,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:37:56,465 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-01-09 15:37:56,467 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-01-09 15:37:56,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:37:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:37:56,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:56,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:56,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 15:37:56,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:57,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:37:58,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-01-09 15:37:59,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2025-01-09 15:38:00,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:38:00,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 84 [2025-01-09 15:38:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 114 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 15:38:00,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:38:43,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:38:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271602491] [2025-01-09 15:38:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271602491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:38:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1335795628] [2025-01-09 15:38:43,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:38:43,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:38:43,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:38:43,546 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-01-09 15:38:43,547 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-01-09 15:38:43,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:38:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:38:44,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:38:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:38:44,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 15:38:44,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:38:53,018 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